A linear algorithm for the Hamiltonian completion number of the line graph of a cactus

Discrete Applied Mathematics

Volumn 136, Issue 2-3, 2004, Pages 197-215

  Detti, Paolo ^a   Meloni, Carlo ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b POLITECNICO DI BARI   (Italy)

Author keywords

Algorithms; Cactus; Hamiltonian completion number; Hamiltonian path; Line graph

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; FUNCTIONS; GRAPHIC METHODS; HAMILTONIANS; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; VECTORS;

CACTUS; HAMILTONIAN COMPLETION NUMBER; HAMILTONIAN PATHS; LINE GRAPHS;

GRAPH THEORY;

EID: 0346686365     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00441-4     Document Type: Article

References (27)

1. Agnetis A., Detti P., Meloni C., Pacciarelli D. Set-up coordination between two stages of a supply chain. Ann. Oper. Res. 107:2001;15-32.
2. Agnetis A., Detti P., Meloni C., Pacciarelli D. A linear algorithm for the Hamiltonian completion number of the line graph of a tree. Inform. Process. Lett. 79:2001;17-24.
3. Aho A.H., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading.
4. Bonuccelli M.A., Bovet D.P. Minimum node disjoint path covering for circular-arc graphs. Inform. Process. Lett. 8(4):1979;159-161.
5. A. Brandstädt, V.B. Le, J.P. Spinard, Graph classes, a survey, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
6. A. De Vitis, The cactus representation of all minimum cuts in weighted graph, Technical Report, 454, IASI-CNR, Roma, 1997.
7. Fleischer L. Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. J. Algorithms. 33(1):1999;51-72.
8. Fomin F.V., Golovach P.A. Graph searching and interval completion. SIAM J. Discrete Math. 13(4):2000;454-464.
9. Goodman S.E., Hedetniemi S.T., Slater P.J. Advances on the Hamiltonian completion problem. J. ACM. 22(3):1975;352-360.
10. Gutman I. Buckley-type relations for Wiener-type structure-descriptors. J. Serbian Chem. Soc. 63(7):1998;491-496.
11. Harary F., Nash-Williams C.St.J.A. On Eulerian and Hamiltonian graphs and line-graphs. Canad. Math. Bull. 8:1965;701-709.
12. Hedetniemi S.T., Laskar R.C., Pfaff J. A linear algorithm for finding a minimum dominating set in a cactus. Discrete Appl. Math. 13:1986;287-292.
13. Klavzar S., Gutman I. Wiener number of vertex-weighted graphs and a chemical application. Discrete Appl. Math. 80(1):1997;73-81.
14. Kundu S. A linear algorithm for the Hamiltonian completion number of a tree. Inform. Process. Lett. 5:1976;55-57.
15. Lehot P.G.H. An optimal algorithm to detect a line graph and output its root graph. J. ACM. 21:1974;569-575.
16. Lin R., Olariu S., Pruesse G. An optimal path cover algorithm for cographs. Comput. Math. Appl. 30(8):1995;75-83.
17. Misra J., Tarjan R.E. Optimal chain partitions of trees. Inform. Process. Lett. 4(1):1975;24-26.
18. Rao Arikati S., Pandu Rangan C. Linear algorithm for optimal path cover problem on interval graphs. Inform. Process. Lett. 35:1990;149-153.
19. Raychaudhuri A. The total interval number of a tree and the Hamiltonian completion number of its line graph. Inform. Process. Lett. 56:1995;299-306.
20. Roussopoulos N.D. A max. {m,n} algorithm for determining the graph H from its line graph G Inform. Process. Lett. 2:1973;108-112.
21. Z. Skupień, Path Partitions of Vertices and Hamiltonity of Graphs, in: M. Fiedler (Ed.), Recent Advances in Graph Theory (Proceedings of the 2nd Czechoslovakian Symposium on Graph Theory, Prague 1974), Akademia, Praha, 1975, pp. 481-491.
22. Skupień Z. Hamiltonian shortage, path partitions of vertices, and matchings in a graph. Colloq. Math. 36(2):1976;305-318.
23. Srikant R., Sundaram R., Singh K.S., Pandu Rangan C. Optimal path cover problem on block graphs and bipartite permutation graphs. Theoret. Comput. Sci. 115:1993;351-357.
24. Veldman H.J. A result of Hamiltonian line graphs involving restrictions on induced subgraphs. J. Graph Theory (12). 3:1988;413-420.
25. Wong P.K. Optimal path cover problem on block graphs. Theoret. Comput. Sci. 225:1999;163-169.
26. Q.S. Wu, C.L. Lu, R.C.T. Lee, An approximate algorithm for the weighted Hamiltonian path completion problem on a tree, in: D.T. Lee, S.H. Teng (Eds.), Proceedings of Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), Lecture Notes in Computer Science, Springer, Berlin, 1969, pp. 156-167.
27. Yan J.H., Chang G.J. The path-partition problem in block graphs. Inform. Process. Lett. 52:1994;317-322.