Recent content by yzhua3

Here are more descriptions: Each node has a 0/1-string label. We define a function to measure the similarity between two labels of the adjacent nodes(i.e. the length of the common prefix of the two labels). At each step only the two adjacent nodes with maximal similarity can be merged (there may...

Thanks for your prompt reply ! In my problem each node is associated with some metric. At each step only a subset of edges are candidates for contracting or merging. Contracting one edge may affect the subset of edges that are legal for contracting at next step. By contracting one edge, we...

I know that graph contractability is NP-complete. To be specific given G=(V1,E1) and H=(V2,E2), can a graph isomorphic to H be obtained from G by a sequence of edge contractions ? However my problem is a little bit different from the traditional graph contractability. In the traditional graph...