Graphs, algorithms, and optimization

Graphs, Algorithms, and Optimization

Volumn , Issue , 2017, Pages 1-483

  Kocay, William ^a   Kreher, Donald L ^b  

^a UNIVERSITY OF MANITOBA   (Canada)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85053101323     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781315272689     Document Type: Book

References (129)

1. A.V. AHO, J.E. HOPCROFT, AND J.D. ULLMAN The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co., Reading, Massachusetts, 1974.
2. M. AIGNER Graph Theory, a Development from the 4-Color Problem, BCS Associates, Moscow, Idaho, 1987.
3. F. ALLAIRE, Another proof of the four colour theorem, Proceedings of the Seventh Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1977), pp. 3-72, Congressus Numerantium, XX, Utilitas Mathematica, Winnipeg, Man., 1978.
4. K. APPEL AND W. HAKEN, Every planar map is four colorable, part I: discharging, Illinois Journal of Mathematics 21 (1977), pp. 429-490.
5. K. APPEL AND W. HAKEN, Every planar map is four colorable, part II: reducibility, Illinois Journal of Mathematics 21 (1977), pp. 491-456.
6. D. ARCHDEACON, A Kuratowski theorem for the projective plane, Journal of Graph Theory 5 (1981), pp. 243-246.
7. E. ARJOMANDI, An efficient algorithm for colouring the edges of a graph with δ + 1 colours, Discrete Mathematical Analysis and Combinatorial Computation, University of New Brunswick, 1980, pp. 108-132.
8. J. BANG-JENSEN AND G. GUTIN Digraphs, Springer-Verlag, New York, 2002.
9. N. BIGGS Algebraic Graph Theory, second edition, Cambridge University Press, Cambridge, 1993.
10. M. BEHZAD AND G. CHARTRAND Introduction to the Theory of Graphs, Allyn & Bacon, Boston, 1971.
11. L.W. BEINEKE AND R.J. WILSON Selected Topics in Graph Theory, Academic Press, London, 1978.
12. L.W. BEINEKE AND R.J. WILSON Selected Topics in Graph Theory 2, Academic Press, London, 1983.
13. L.W. BEINEKE AND R.J. WILSON Selected Topics in Graph Theory 3, Academic Press, London, 1988.
14. C. BERGE Graphs and Hypergraphs, North-Holland Publishing Co., Amsterdam, 1979.
15. J.-C. BERMOND, Hamiltonian graphs, in [11], pp. 127-168.
16. R.G. BLAND, New finite pivoting rules for the simplex method. Mathematics of Operations Research 2 (1977), 103-107.
17. B. BOLLOBÀS, Graph Theory, An Introductory Course, Springer-Verlag, New York, 1979.
18. B. BOLLOBÀS, Modern Graph Theory, Springer-Verlag, New York, 2002.
19. J.A. BONDY AND U.S.R. MURTY Graph Theory with Applications, American Elsevier Publishing Co., New York, 1976.
20. D. BRELAZ, New methods to color the vertices of a graph, Communications ACM 22 (1970), pp. 251-256.
21. M. CAPOBIANCO AND J.C. MOLLUZZO Examples and Counterexamples in Graph Theory, Elsevier North-Holland, New York, 1978.
22. D. CHERITON AND R.E. TARJAN, Finding minimum spanning trees, SIAM Journal of Computing 5 (1976), pp. 724-742.
23. G. CHARTRAND AND F. HARARY, Graphs with prescribed connectivities, in, Theory of Graphs, Proceedings Tihany, 1966, Ed. P. Erdös and G. Katona, Academic Press, 1968, pp. 61-63.
24. G. CHARTRAND AND L. LESNIAK Graphs and Digraphs, Wadsworth & Brooks/Cole, Monterey, California, 1986.
25. G. CHARTRAND AND O. OELLERMANN Applied and Algorithmic Graph Theory, McGraw-Hill, Inc., New York, 1993.
26. N. CHRISTOFIDES Graphs Theory, An Algorithmic Approach, Academic Press, London, 1975.
27. V. CHVÀTAL, Linear Programming, W.H. Freeman and Co., 1983.
28. S.A. COOK, The complexity of theorem proving procedures, Proc. Third ACM Symposium on the Theory of Computing, ACM (1971), pp. 151-158.
29. H.S.M. COXETER Regular Polytopes, Dover Publications, New York, 1973.
30. D. CVETKOVIC, M.D. DOOB, AND H. SACHS Spectra of Graphs: Theory and Applications, John Wiley & Sons, 1998.
31. G.B. DANTZIG, Programming of independent activities, II, mathematical model. Econometrics 17 (1949), pp. 200-211.
32. G.B. DANTZIG, Programming of independent activities, II, mathematical model, in Activative of Production and Allocations, ed. T.C. Koopermans, John Wiley & Sons, New York, 1951, pp. 19-32.
33. G.B. DANTZIG Linear Programming and Extensions, Princeton University Press, 1963.
34. N. DEO Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, New Jersey, 1974.
35. R. DIESTEL Graph Theory, Graduate Texts in Mathematics 173, Springer-Verlag, New York, Berlin, Heidelberg, 1997.
36. G.A. DIRAC, Some theorems on abstract graphs, Proceedings London Mathematical Society 2 (1952), pp. 69-81.
37. J.R. EDMONDS, A combinatorial representation for polyhedral surfaces, Notices American Mathematical Society 7 (1960), pp. 646.
38. J.R. EDMONDS, Paths, trees, and flowers, Canadian Journal of Mathematics 17 (1965), pp. 449-467.
39. J.R. EDMONDS AND R.M. KARP, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the Association of Computing Machinery 19 (1972), pp. 248-264.
40. S. EVEN Graph Algorithms, Computer Science Press, Potomac, Maryland, 1979.
41. J.R. FIEDLER, J.P. HUNEKE, R.B. RICHTER, AND N. ROBERTSON, Computing the orientable genus of projective graphs, Journal of Graph Theory 20 (1995), pp. 297-308.
42. J-C. FOURNIER, Colorations des aretes d’un graphe, Cahiers du CERO 15 (1973), pp. 311-314.
43. L.R. FORD, JR. AND D.R. FULKERSON, Maximal flow through a network, Canadian Journal of Mathematics 8 (1956), pp. 399-404.
44. M. FRÉCHET AND KY FAN Initiation to Combinatorial Topology, Prindle, Weber, & Schmidt, Inc., Boston, 1967.
45. C. FREMUTH-PAEGER AND D. JUNGNICKEL, An introduction to balanced network flows, in Codes and Designs, Ohio State University, Math. Res. Inst. Publ. 10 (2000), pp. 125-144.
46. D.R. FULKERSON, ED., Studies in Graph Theory, Parts I and II, Mathematical Association of America, Washington, D.C., 1975.
47. D.R. FULKERSON, Flow networks and combinatorial operations research, in [46], pp. 139-171.
48. A. GAGARIN Graph Embedding Algorithms, Ph.D. thesis, University of Manitoba, 2003.
49. 5 subdivisions, Ars Combinatoria 64 (2002), pp. 33-49.
50. M.R. GAREY AND D.S. JOHNSON Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, California, 1979.
51. A. GIBBONS Algorithmic Graph Theory, Cambridge University Press, Cambridge, 1985.
52. C. GODSIL AND G. ROYLE Algebraic Graph Theory, Springer-Verlag, New York, 2001.
53. R. GOULD Graph Theory, Benjamin/Cummings Publishing, Menlo Park, California, 1988.
54. J.L. GROSS AND T.W. TUCKER Topological Graph Theory, John Wiley & Sons, New York, 1987.
55. J. GROSS AND J. YELLEN Graph Theory and Its Applications, CRC Press, Boca Raton, Florida, 1999.
56. B. GRÜNBAUM, Convex Polytopes, Springer-Verlag, New York, 2003.
57. G. HADLEY, Linear programming, Addison- Wesley Publishing Co., 1962.
58. P. HALL, On representatives of subsets, Journal london Mathematical Society 10 (1935), pp. 26-30.
59. F. HARARY Graph Theory, Addison-Wesley Publishing Co., Reading, Massachusetts, 1972.
60. L. HEFFTER, Über das Problem der Nachbargebiete, Mathematisce Annalen 38 (1891), pp. 477-508.
61. D. HILBERT AND S. COHN-VOSSEN, Geometry and the Imagination, Chelsea Publishing Co., New York, 1983.
62. A.J. HOFFMAN, Eigenvalues of graphs, in [46], pp. 225-245.
63. A.J. HOFFMAN AND R.R. SINGLETON, On Moore graphs with diameters 2 and 3, IBM Journal of Research and Development 4 (1960), pp. 497-504.
64. I. HOLYER, The NP-completeness of edge-coloring, SIAM Journal of Computing 10 (1981), pp. 718-720.
65. 5/2 algorithm for maximum matching in bipartite graphs, SIAM Journal of Computing 2 (1973), pp. 225-231.
66. J. HOPCROFT AND R.E. TARJAN, Efficient planarity testing, Journal of the Association of Computing Machinery 21 (1974), pp. 449-568.
67. J. HOPCROFT AND R.E. TARJAN, Algorithm 447: efficient algorithms for graph manipulation, CACM 16 (1973), pp. 372-378.
68. J. HOPCROFT AND R.E. TARJAN, Dividing a graph into triconnected components, SIAM Journal of Computing 2 (1973), pp. 135-158.
69. D.S. JOHNSON, Worst case behavior of graph coloring algorithms, Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium 10 (1974), pp. 513-527.
70. R.M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, eds. R.E. Miller and J.W Thatcher, Plenum Press, New York, 1972, pp. 85-103.
71. L.G. KHACHIAN, A polynomial algorithm in linear programing, Doklady Adademiia Nauk SSR 224 (1979), 1093-1096. (English translation: Soviet Mathematics Doklady 20 (1979), 191-194.)
72. V. KLEE AND G.J. MINTY, HOW good is the simplex algorithm?, in Inequalities-III, ed. O. Shisha, Acdemic Press, New York, pp. 159-175, 1972.
73. W. KLOTZ, A constructive proof of Kuratowski’s theorem, Ars Combinatoria, 28 (1989), pp. 51-54.
74. D.E. KNUTH The Art of Computer Programming, Addison-Wesley Publishing Co., Reading, Massachusetts, 1973.
75. D.E. KNUTH Searching and Sorting, Addison Wesley Publishing Co., Reading, Massachusetts, 1973.
76. W. KOCAY, D. NEILSON AND R. SZYPOWSKI, Drawing graphs on the torus, Ars Combinatoria 59 (2001), 259-277.
77. W. KOCAY, An extension of the multi-path algorithm for finding hamilton cycles, Discrete Mathematics 101, (1992), pp. 171-188.
78. W. KOCAY AND PAK-CHING LI, An algorithm for finding a long path in a graph, Utilitas Mathematica 45 (1994) pp. 169-185.
79. W. KOCAY AND C. PANTEL, An algorithm for constructing a planar layout of a graph with a regular polygon as outer face, Utilitas Mathematica 48 (1995), pp. 161-178.
80. W. KOCAY AND D. STONE, Balanced network flows, Bulletin of the Institute of Combinatorics and Its Applications 7 (1993), pp. 17-32.
81. D.L. KREHER AND D.R. STINSON Combinatorial Algorithms: Generation, Enumeration and Search, CRC Press, Boca Raton, Florida, 2000.
82. C. KURATOWSKI, Sur le problème des curbes gauche en topologie, Fund. Math. 15 (1930), pp. 271-283.
83. E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, AND D.B. SHMOYS, EDS., The Traveling Salesman Problem, John Wiley & Sons, Essex, U.K., 1990.
84. L. LOVÀSZ, Three short proofs in graph theory, Journal of Combinatorial Theory (B) 19 (1975), pp. 111-113.
85. L. LOVÀSZ AND M.D. PLUMMER Matching Theory, Elsevier Science, 1986.
86. D. MCCARTHY AND R.G. STANTON, EDS., Selected Papers of W.T Tutte, Charles Babbage Research Centre, St. Pierre, Manitoba, 1979.
87. B. MOHAR, Projective planarity in linear time, Journal of Algorithms 15 (1993), pp. 482-502.
88. B. MOHAR AND C. THOMASSEN Graphs on Surfaces, Johns Hopkins University Press, Baltimore, 2001.
89. J.W. MOON Topics on Tournaments, Holt, Rinehart, and Winston, New York, 1968.
90. W. MYRVOLD, personal communication, 2004.
91. W. MYRVOLD AND J. ROTH, Simpler projective planar embedding, Ars Combinatoria, to appear.
92. G.L. NEMHAUSER AND L.A. WOLSEY Integer and Combinatorial Optimization, John Wiley & Sons, 1988.
93. O. ORE The Four-Colour Problem, Academic Press, New York, 1967.
94. C.H. PAPADIMITRIOU AND K.STEIGLITZ, Combinatorial Optimization, Dover Publications Inc., Mineola, New York, 1998.
95. H. PRÜFER, Neuer Beweis eines Satzes über Permutationen, Arch. Math. Phys. 27 (1918), pp. 742-744.
96. P.W. PURDOM, JR. AND CA. BROWN The Analysis of Algorithms, Holt, Rinehart, Winston, New York, 1985.
97. R.C. READ, ED., Graph Theory and Computing, Academic Press, New York, 1972.
98. R.C. READ, The coding of various kinds of unlabeled trees, in [97].
99. R.C. READ, Graph theory algorithms, in Graph Theory and its Applications, ed. Bernard Harris, Academic Press, New York, 1970, pp. 51-78.
100. R.C. READ, A new method for drawing a planar graph given the cyclic order of the edges at each vertex, Congressus Numerantium 56 (1987), pp. 31-44.
101. R.C. READ AND W.T. TUTTE, Chromatic polynomials, in [13], pp. 15-42.
102. K.B. REID AND L.W. BEINEKE, Tournaments, in [11], pp. 83-102.
103. N. ROBERTSON AND P.D. SEYMOUR, Graph minors-a survey, in Surveys in Combinatorics 1985, Proceedings of the Tenth British Combinatorial Conference, (I. Anderson, ed.), London Math. Society Lecture Notes 103, Cambridge, 1985, pp. 153-171.
104. N. ROBERTSON, D.P. SANDERS, R SEYMOUR, AND R. THOMAS, The four-colour theorem, Journal of Combinatorial Theory (B) 70 (1997), pp. 2-44.
105. F. RUBIN, A search procedure for hamilton paths and circuits, JACM 21 (1974), pp. 576-580.
106. T.L. SAATY AND P.C. KAINEN The Four-Color Problem, Assaults and Conquest, Dover Publications, New York, 1977.
107. A.J. SCHWENK AND R.J. WILSON, Eigenvalues of graphs, in [11], pp. 307-336.
108. R. SEDGEWICK Algorithms in C++, Addison-Wesley Publishing Co., Boston, 1998.
109. J. STILLWELL Classical Topology and Combinatorial Group Theory, Spinger-Verlag, New York, 1980.
110. H.A. TAHA Operations Research: An introduction, Prentice Hall, Engle-wood Cliffs, New Jersey, 2003.
111. R.E. TARJAN, Depth-first search and linear graph algorithms, SIAM Journal of Computing 1 (1972) pp. 146-160.
112. C. THOMASSEN, Kuratowski’s Theorem, Journal of Graph Theory 5 (1981), pp. 225-241.
113. C. THOMASSEN, The graph genus problem is NP-complete, Journal of Algorithms 10 (1989), pp. 568-576.
114. C. THOMASSEN, Planarity and duality of finite and infinite graphs, Journal of Combinatorial Theory (B) 29 (1980), pp. 244-271.
115. R. TRUDEAU Introduction to Graph Theory, Dover Publications, Mineola, 1994.
116. W.T.TUTTE, How to draw a graph, in [86], pp. 360-388.
117. W.T.TUTTE, A short proof of the factor theorem for finite graphs, in [86], pp. 169-175.
118. W.T.TUTTE, The factorization of linear graphs, in [86], pp. 89-97.
119. W.T.TUTTE, Chromials, in [46], pp. 361-377.
120. W.T.TUTTE, Connectivity in Graphs, University of Toronto Press, 1966.
121. R.C. WALKER Introduction to Mathematical Programming, Prentice Hall, Englewood Cliffs, New Jersey, 1999.
122. M.A. WEISS Data Structures and Algorithm Analysis, Benjamin Cummings Publishing Co., Redwood City, California, 1992.
123. D.B. WEST Graph Theory, Prentice Hall, Upper Saddle River, New Jersey, 1996.
124. A.T. WHITE, The Proof of the Heawood Conjecture, in [11].
125. H. WHITNEY, 2-Isomorphic Graphs, Amerirican Journal of Mathematics 55 (1933), pp. 245-254.
126. S.G. WILLIAMSON, Embedding graphs in the plane algorithmic aspects, Annals of Discrete Mathematics 6 (1980), pp. 349-384.
127. R.J. WILSON Four Colours Suffice, Penguin Books, London, 2002.
128. D.R. WOODALL AND R.J. WILSON, The Appel-Haken proof of the four-colour theorem, in [11], pp. 83-102.
129. G.M. ZIEGLER Lectures on Polytopes, Springer-Verlag, New York, 1998.