Σημειώσεις
· Graph-Theoretic Algorithms, Therese Biedl
· Computers and Intractability: A guide to the Theory of NP-completeness, M. R. Garey and D. S. Johnson [κεφ2] [κεφ3]
· Αλγόριθμοι, S. Dasgupta, Χ. Παπαδημητρίου και U. Vazirani [κεφ8]
· Σχεδιασμός Αλγορίθμων, J. Kleinberg και E. Tardos, [κεφ7]
· Treewidth, partial k-trees, and chordal graphs, P. Heggernes
Άρθρα
· Efficient Planarity Testing, J. Hopcroft and R. E. Tarjan, JACM (21:4), 1974
· Applications of a Planar Separator Theorem, R. Lipton and R. E. Tarjan, SIAM (9:3), 1980
· A Separator Theorem for Planar Graphs, R. Lipton and R. E. Tarjan, SIAM (36:2), 1979
· Testing for the Consecutive Ones Property , Interval Graphs, and Graph Planarity using PQ-Tree Algorithms, K. S. Booth and G. S. Lueker, JCSS (13), 1976
· Planarity Algorithms via PQ-Trees, B. Haeuper and R. E. Tarjan, Electronic Notes in Discrete Mathematics (31), 2008.
· PC-Trees vs. PQ-Trees, W.-L. Hsu, COCOON 2001.
· PQ Trees, PC Trees, and Planar Graphs”, W.-L. Hsu, R. M. McConnell, CRC 2001.
· Finding Small Simple Cycle Separators for 2-Connected Planar Graphs, G. L. Miller, JCSS (32), 1986.
· Fast Algorithms for Shortest Paths in Planar Graphs, with Applications, G. N. Frederickson, SICOMP (16:6), 1987.
· Finding a Maximum Cut of a Planar Graph in Polynomial Time, F. Hadlock, SICOMP (4:3), 1975.
· Unifying Maximum Cut and Minimum Cut of a Planar Graph, W.-K. Shih, S. Wu, and Y. S. Kuo, IEEE Transactions on Computers (39:5), 1990.
· An O(nlogn) Algorithm for Maximum st-Flow in a Directed Planar Graph, G. Borradaile and P. Klein, JACM (56:2), 2009.
· Maximum Flows and Parametric Shortest Paths in Planar Graphs, J. Erickson, SODA 2010.
· Faster Shortest-Path Algorithms for Planar Graphs, M. R. Henzinger, P. Klein, S. Rao, S. Subramanian, JCSS (55), 1997.
