1951 search results - page 138 / 391 » An algorithm for improving graph partitions |
148
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
151
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
170
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
147
click to vote
GD
1999
Springer
15 years 8 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
168
Voted
APBC
2004
15 years 6 months ago
2004
Huge amount of gene expression data have been generated as a result of the human genomic project. Clustering has been used extensively in mining these gene expression data to find...