Bibliography
- [AMO93]Book
Network Flows, Theory, Algorithms, and Applications.
Prentice Hall, 1993.Cited in 1 page
- [BK73]Article
Finding All Cliques of an Undirected Graph.
Communications of the ACM 9, 16(9):575–577, 1973. - [BM01]Preprint
Simplified O($n$) Planarity Algorithms.
Submitted to J. Algorithms, 2001.Cited in 1 page
- [Bre79]Article
New Methods to Color the Vertices of a Graph.
Communications of the ACM, 22(9):251–256, 1979. - [Chr75]Book
Graph Theory, An Algorithm Approach.
Academic Press, 1975.Cited in 1 page
- [CLR90]Book
Introduction to Algorithms.
MIT Press, 1990.Cited in 1 page
- [Eve79]Book
Graph Algorithms.
Computer Science Press, 1979.Cited in 2 pages
- [GM01]Book Chapter
A Linear Time Implementation of SPQR-Trees.
In J. Marks, editor, Graph Drawing 2000, volume 1984 of LNCS, pages 70–90. Springer-Verlag, 2001.Cited in 1 page
- [HT73]Article
Dividing a Graph into Triconnected Components.
SIAM J. Comput., 2(3):135–158, 1973.Cited in 1 page
- [Lor89]Article
The construction of Tutte's $8$-cage and the Conder graph.
J. of Graph Theory, 13(5):553–557, 1989. - [McK81]Article
Practical Graph Isomorphism.
Congressus Numerantium, 30:45–87, 1981. - [McK98]Article
Isomorph-free exhaustive generation.
J. Algorithms, 26:306–324, 1998. - [MP]Preprint
nauty and Traces User's Guide (Version 2.6).
http://pallini.di.uniroma1.it/nug26.pdf. - [MPW]Preprint
A Dynamic Programming Approach for Timing and Designing Clique Algorithms.
available at http://www.csr.uvic.ca/~wendym/.Cited in 1 page