9532 search results - page 131 / 1907 » Logic, Graphs, and Algorithms |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
121
click to vote
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
WG
2001
Springer
15 years 3 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
107
click to vote
JCP
2008
14 years 11 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
106
click to vote
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...