Skip to main content
×
Home
    • Aa
    • Aa

Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow

  • D. S. Franzblau (a1) and A. Raychaudhuri (a2)
Abstract

A minimum Hamiltonian completion of a graph G is a minimum-size set of edges that, when added to G, guarantee a Hamiltonian path. Finding a Hamiltonian completion has applications to frequency assignment as well as distributed computing. If the new edges are deleted from the Hamiltonian path, one is left with a minimum path cover, a minimum-size set of vertex-disjoint paths that cover the vertices of G. For arbitrary graphs, constructing a minimum Hamiltonian completion or path cover is clearly NP-hard, but there exists a linear-time algorithm for trees. In this paper we first give a description and proof of correctness for this linear-time algorithm that is simpler and more intuitive than those given previously. We show that the algorithm extends also to unicyclic graphs. We then give a new method for finding an optimal path cover or Hamiltonian completion for a tree that uses a reduction to a maximum flow problem. In addition, we show how to extend the reduction to construct, if possible, a covering of the vertices of a bipartite graph with vertex-disjoint cycles, that is, a 2-factor.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
      Available formats
      ×
Copyright
References
Hide All
[1]Boesch F. T., Chen S. and McHugh N. A. M., “On covering the points of a graph with point disjoint paths”, in Graphs and combinatorics (eds. Dold A. and Eckman B.), Lecture Notes in Math. 406, (Springer, Berlin, 1974) 201–212.
[2]Boesch F. T. and Gimpel J. F., “Covering the points of a digraph with point-disjoint paths and its application to code optimization”, JACM 24 (1977) 192198.
[3]Bondy J. A. and Murty U. S. R., Graph theory with applications (North Holland, NY, 1976).
[4]Diestel R., Graph theory (Springer, NY, 1997).
[5]Ford L. R. and Fulkerson D. R, “A simple algorithm for finding maximal network flows and an application to the Hitchcock problem”, Canadian J. Math. 9 (1957) 210218.
[6]Goodman S. E. and Hedetniemi S. T., “On the Hamiltonian completion problem”, in Graphs and combinatorics (eds. Dold A. and Eckman B.), Lecture Notes in Math. 406, (Springer, Berlin, 1974) 262272.
[7]Goodman S. E., Hedetniemi S. T. and Slater P. J., “Advances on the Hamiltonian completion problem”, JACM. 22 (1975) 352360.
[8]Hale W. K., “Frequency assignment: Theory and applications”, roc. IEEE 68 (1980) 14971514.
[9]Karejan Z. A. and Mosesjan K. M., “The Hamiltonian completion number of a digraph”, Akad. Nauk Armyan. SSR Dokl. 70 (1980) 129132 (in Russian).
[10]Kornienko N. M., “The Hamiltonian completion of some classes of graphs”, VestsīAkad. Navuk BSSR, Ser. Fīz.-Mat. Navuk 124 (1982) 1822 (in Russian).
[11]Kundu S., “A linear algorithm for the Hamiltonian completion number of a tree”, Info. Proc. Letters 5 (1976) 5557.
[12]Lawler E. L., Combinatorial optimization: Networks and matroids (Holt, Rinehart, and Winston, NY, 1976).
[13]Moran S. and Wolfstahl Y., “Optimal covering of cacti by vertex-disjoint paths”, Theoret. Comp. Sci. 84 (1991) 179197.
[14]Pinter S. S. and Wolfstahl Y., “On mapping processes to processors in distributed systems”, Internat. J. Parallel Prog. 16 (1987) 115.
[15]Raychaudhuri A., “Intersection assignments, T-colorings, and powers of graphs”, Ph. D. Thesis, Rutgers Univ., 1985.
[16]Roberts F. S., Applied combinatorics (Prentice-Hall, Englewood Cliffs, NJ, 1984).
[17]Tucker A., Applied combinatorics (Wiley, NY, 1980).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The ANZIAM Journal
  • ISSN: 1446-1811
  • EISSN: 1446-8735
  • URL: /core/journals/anziam-journal
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 39 *
Loading metrics...

Abstract views

Total abstract views: 73 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd October 2017. This data will be updated every 24 hours.