IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i5d10.1007_s10878-022-00897-4.html
   My bibliography  Save this article

Algorithms for maximum internal spanning tree problem for some graph classes

Author

Listed:
  • Gopika Sharma

    (Indian Institute of Technology Ropar)

  • Arti Pandey

    (Indian Institute of Technology Ropar)

  • Michael C. Wigal

    (Georgia Institute of Technology)

Abstract

For a given graph G, a maximum internal spanning tree of G is a spanning tree of G with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem is to find a maximum internal spanning tree of the given graph. The MIST problem is a generalization of the Hamiltonian path problem. Since the Hamiltonian path problem is NP-hard, even for bipartite and chordal graphs, two important subclasses of graphs, the MIST problem also remains NP-hard for these graph classes. In this paper, we propose linear-time algorithms to compute a maximum internal spanning tree of cographs, block graphs, cactus graphs, chain graphs and bipartite permutation graphs. The optimal path cover problem, which asks to find a path cover of the given graph with maximum number of edges, is also a well studied problem. In this paper, we also study the relationship between the number of internal vertices in maximum internal spanning tree and number of edges in optimal path cover for the special graph classes mentioned above.

Suggested Citation

  • Gopika Sharma & Arti Pandey & Michael C. Wigal, 2022. "Algorithms for maximum internal spanning tree problem for some graph classes," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3419-3445, December.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00897-4
    DOI: 10.1007/s10878-022-00897-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00897-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00897-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhi-Zhong Chen & Youta Harada & Fei Guo & Lusheng Wang, 2018. "An approximation algorithm for maximum internal spanning tree," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 955-979, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00897-4. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.