Complexity of Splits Reconstruction for Low-Degree Trees
From MaRDI portal
Publication:3104774
DOI10.1007/978-3-642-25870-1_16zbMath1341.05108arXiv1007.1733WikidataQ62046047 ScholiaQ62046047MaRDI QIDQ3104774
Serge Gaspers, Mathieu Liedloff, Karol Suchan, Maya Jakobine Stein
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.1733
05C05: Trees
05C90: Applications of graph theory
05C07: Vertex degrees
05C22: Signed and weighted graphs
Related Items
Uses Software
Cites Work
- Parameterizing by the number of numbers
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- Deconstructing Intractability: A Case Study for Interval Constrained Coloring
- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item