Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4093
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, G.-
dc.contributor.authorPandey, A.-
dc.contributor.authorWiga, M.C.-
dc.date.accessioned2022-10-20T19:48:53Z-
dc.date.available2022-10-20T19:48:53Z-
dc.date.issued2022-10-21-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/4093-
dc.description.abstractFor 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.en_US
dc.language.isoen_USen_US
dc.subjectMaximum internal spanning treeen_US
dc.subjectBipartite graphsen_US
dc.subjectChordal graphsen_US
dc.subjectOptimal path coveren_US
dc.subjectNP-completenessen_US
dc.subjectGraph Algorithmsen_US
dc.titleAlgorithms for maximum internal spanning tree problem for some graph classesen_US
dc.typeArticleen_US
Appears in Collections:Year-2022

Files in This Item:
File Description SizeFormat 
Full Text.pdf825.9 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.