Journal Article10.1016/J.TCS.2017.09.017
Solving the maximum internal spanning tree problem on interval graphs in polynomial time
5
TL;DR: The problem of finding a spanning tree with the maximum number of internal vertices on a graph is studied and it is proved that the problem can be solved in polynomial time on interval graphs.
read more
About: This article is published in Theoretical Computer Science. The article was published on 01 Sep 2017. The article focuses on the topics: Spanning tree & Minimum spanning tree.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees
TL;DR: In this paper , a leaf-distance granular regular α-subtree (LDR α-tree) is introduced, where the distance between any two leaves is divisible by α (α is a positive integer).
6
A simple linear time algorithm to solve the MIST problem on interval graphs
Peng Li,Jian-dong Shang,Yi Shi +2 more
TL;DR: In this paper , a simple linear time algorithm was proposed to solve the maximum internal spanning tree problem in a connected interval graph, which is based on the structure of normal orderings on interval graphs.
Algorithms for maximum internal spanning tree problem for some graph classes
TL;DR: In this article , the authors proposed linear-time algorithms to compute a maximum internal spanning tree of cographs, block graphs, cactus graphs, chain graphs and bipartite permutation graphs.
Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs
TL;DR: Researchers propose algorithms for enumerating multiple leaf-distance granular regular α-subtrees in unicyclic and edge-disjoint bicyclic graphs using generating functions and structure decomposition, enabling enumeration of various LDR α-subtrees.
Finding a Minimum Spanning Tree with a Small Non-Terminal Set
Tesshu Hanaka,Yasuaki Kobayashi +1 more
TL;DR: It is shown that Minimum Weight Non-Terminal Spanning Tree is fixed-parameter tractable parameterized by the number of edges in the subgraph induced by the non-terminal set $V_{\rm NT}$.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Algorithmic graph theory and perfect graphs
Martin Charles Golumbic
- 01 Jan 1980
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
4.3K
A unified approach to domination problems on interval graphs
TL;DR: Une propriete tres simple des graphes intervalle is utilisee dans la realisation d'algorithmes a temps lineaire, developpes pour la resolution de differents problemes de domination as mentioned in this paper.
146