Complexity of splits reconstruction for low-degree trees

DOI10.1016/J.DAM.2014.08.005zbMATH Open1303.05028OpenAlexW4205985989WikidataQ62046030 ScholiaQ62046030MaRDI QIDQ476307FDOQ476307

Authors: Serge Gaspers, Mathieu Liedloff, Karol Suchan, Maya Stein 

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.005

Recommendations

• Complexity of splits reconstruction for low-degree trees
• scientific article; zbMATH DE number 2121259
• On the complexity of graph tree partition problems.
• Partitioning a weighted tree into subtrees with weights in a given range
• Tree Reconstruction from Partial Orders

zbMATH Keywords

computational complexitycomputational chemistryreconstruction of trees

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Title not available (Why is that?)
• Parametrized complexity theory.
• Title not available (Why is that?)
• Wiener index of trees: Theory and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of trees and its Wiener index
• Parameterizing by the number of numbers
• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
• All but 49 numbers are Wiener indices of trees
• Special issue: 50th anniversary of the Wiener index
• Complexity of splits reconstruction for low-degree trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multivariate complexity theory
• A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard

Cited In (2)

• Title not available (Why is that?)
• Complexity of splits reconstruction for low-degree trees

Uses Software

• OCOTILLO

This page was built for publication: Complexity of splits reconstruction for low-degree trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476307)