Reconstructing graphs with subgraph compositions

DOI10.1016/J.DAM.2026.04.023MaRDI QIDQ7262737zbMATH OpenFDO

Authors Antoine Dailly, Tuomo Lehtilä

Publication date 12 June 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.04.023

zbMATH Keywords

graph reconstructionmass spectrometrypolymer-based data storagetrees

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx) Communication, information (94Axx)

Cites work

• A congruence theorem for trees
• A new approach to graph reconstruction using supercards
• A survey of some open questions in reconstruction numbers.
• Coding for polymer-based data storage
• Efficient reconstruction of sequences
• Efficient reconstruction of sequences from their subsequences of supersequences
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3458693 (Why is no real title available?)
• Insertion and deletion correction in polymer-based data storage
• On Levenshtein’s Channel and List Size in Information Retrieval
• On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
• Proceedings of the IEEE international symposium on information theory, ISIT 2012, Cambridge, MA, USA, July 1--6, 2012
• Reconstruction from the deck of k-vertex induced subgraphs
• Reconstruction of a single string from a part of its composition multiset
• Reconstruction of trees from jumbled and weighted subtrees
• Sequence reconstruction problem for deletion channels: a complete asymptotic solution
• String reconstruction from substring compositions
• The Levenshtein's sequence reconstruction problem and the length of the list

This page was built for publication: Reconstructing graphs with subgraph compositions

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