|
58
|
Arboricity and subgraph listing algorithms
– N Chiba, T Nishizeki
- 1985
|
|
1107
|
Network Flows: Theory, Algorithms, and Applications
– Ravindra K Ahuja, Thomas L Magnanti, James B Orlin
- 1993
|
|
73
|
Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees
– Greg N. Frederickson
- 1991
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
312
|
Graph Algorithms
– S Even
- 1979
|
|
168
|
Embedding planar graphs on the grid
– W Schnyder
- 1990
|
|
54
|
Edge-disjoint spanning trees of finite graphs
– C S A Nash-Williams
- 1961
|
|
11
|
A Linear-Time Algorithm For Testing The Inscribability Of Trivalent Polyhedra
– Michael B. Dillencourt, Warren D. Smith
- 1995
|
|
18
|
The clique problem for planar graphs
– C Papadimitriou, M Yannakakis
- 1981
|
|
89
|
Subgraph Isomorphism in Planar Graphs and Related Problems
– David Eppstein
- 1999
|
|
338
|
A Separator Theorem for Planar Graphs f
– Richard J. Lipton, Robert E. Tarjan
- 1977
|
|
15
|
A new method for drawing a planar graph given the cyclic order of the edges at each vertex
– R C Read
- 1987
|
|
42
|
Algorithms for drawing graphs: an annotated bibliography
– G Battista
- 1994
|
|
36
|
Updating Distances in Dynamic Graphs
– S Even, H Gazit
- 1985
|
|
657
|
A note on Two Problems in Connection with Graphs
– E Dijkstra
|
|
171
|
Mesh Generation And Optimal Triangulation
– Marshall Bern, David Eppstein
- 1992
|
|
4
|
A Fast Randomized Parallel Algorithm for Finding Simple Cycles
– C F Dorgerloh
- 1996
|
|
12
|
Communication-efficient parallel graph algorithms for distributed random-access machines
– C E Leiserson, B M Maggs
- 1988
|
|
14
|
Optimal parallel algorithms on planar graphs
– T Hagerup
- 1990
|
