Back to search
Finding short cycles in planar graphs using separators
Data up to Jan 2025
Published1986
Citations25
References10
Total Citations Per Year
Abstract
References (10)
A Separator Theorem for Planar Graphs
1979 • 1,381 citations
Applications of a Planar Separator Theorem
1980 • 667 citations
Arboricity and Subgraph Listing Algorithms
1985 • 645 citations
Smallest-last ordering and clustering and graph coloring algorithms
1983 • 492 citations
Finding a Minimum Circuit in a Graph
1978 • 406 citations
Weakly bipartite graphs and the Max-cut problem
1981 • 173 citations
The clique problem for planar graphs
1981 • 60 citations
Finding small simple cycle separators for 2-connected planar graphs.
1984 • 34 citations
The complexity of determining a shortest cycle of even length
1983 • 32 citations
Finding Cycles of a Given Length
1985 • 20 citations
Cited By (0)
Loading...