205 search results - page 3 / 41 » Pruning 2-Connected Graphs |
DM
2002
13 years 6 months ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
DM
2008
13 years 6 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
ISAAC
2005
Springer
13 years 12 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
DAM
2002
13 years 6 months ago
2002
The coupled graph c(G) of a plane graph G is the graph de
ICDM
2006
IEEE
14 years 12 days ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...