User menu

Linear-time Algorithms for the 2-connected Steiner Subgraph Problem On Special Classes of Graphs

Bibliographic reference Coullard, CR. ; Rais, Abdur ; Rardin, RL. ; Wagner, DK.. Linear-time Algorithms for the 2-connected Steiner Subgraph Problem On Special Classes of Graphs. In: Networks (New York) : an international journal, Vol. 23, no. 3, p. 195-206 (1993)
Permanent URL http://hdl.handle.net/2078.1/49771
  1. Monma, Operations Research, 37, 531 (1989)
  2. Grötschel, SIAM Journal on Discrete Mathematics, 3, 502 (1990)
  3. Grötschel, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 5, 121 (1991)
  4. Grötschel, Operations Research, 40, 309 (1992)
  5. Monma, Mathematical Programming, 46, 153 (1990)
  6. and . Network synthesis with connectivity constraints—a survey. In Operational Research '81, ed. North Holland, Amsterdam (1981) 705–723.
  7. and . On two-connected subgraph polytopes. Unpublished paper (1991).
  8. , , and . The 2-connected-spanning-subgraph polytope for series-parallel graphs. Report No. 90-12, School of Industrial Engineering, Purdue University (1990).
  9. , , and . The 2-connected-Steiner subgraph polytope for series-parallel graphs. Report No. 91-23, School of Industrial Engineering, Purdue University (1991).
  10. , , and . The dominant of the 2-connected-Steiner-subgraph polytope for W4-free graphs. Report No. 91-28, School of Industrial Engineering, Purdue University (1991).
  11. Winter, Journal of Algorithms, 7, 549 (1986)
  12. Cornuéjols, Mathematical Programming, 16, 287 (1983)
  13. Bondy J. A., Murty U. S. R., Graph Theory with Applications, ISBN:9780333226940, 10.1007/978-1-349-03521-2
  14. Connectivity in Graphs. University of Toronto Press, Toronto (1966).
  15. Cunningham William H., Edmonds Jack, A combinatorial decomposition theory , 10.4153/cjm-1980-057-7
  16. Hopcroft, SIAM Journal on Computing, 2, 135 (1973)
  17. Barahona, SIAM Journal on Discrete Mathematics.
  18. Gan, Mathematical Programming, 45, 311 (1989)
  19. Tutte, Proceedings Koninklijke Akademie van Wetenschappen te Amsterdam, 64, 441 (1961)
  20. Studies on minimally n-connected graphs. In Combinatorial Mathematics and Its Applications, ed. Academic Press, New York (1971) 129–136.
  21. Cornuéjols, Journal of the ACM, 32, 383 (1985)