Complexity of Splits Reconstruction for Low-Degree Trees

DOI10.1007/978-3-642-25870-1_16zbMath1341.05108arXiv1007.1733OpenAlexW3101884664WikidataQ62046047 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

zbMATH Keywords

vertex-weighted treelibraries of chemical compounds

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Vertex degrees (05C07) Signed and weighted graphs (05C22)

Related Items (2)

Complexity of splits reconstruction for low-degree trees ⋮ Parameterizing by the number of numbers

Uses Software

• OCOTILLO

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

This page was built for publication: Complexity of Splits Reconstruction for Low-Degree Trees