Reconstructing graphs from cut-set sizes

DOI10.1016/0020-0190(89)90012-4zbMath0695.05054OpenAlexW2051329734MaRDI QIDQ909677

Steven S. Skiena

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90012-4

zbMATH Keywords

completely reconstructiblecut-set probe

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Two equivalent measures on weighted hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• A generalized model for understanding evasiveness

This page was built for publication: Reconstructing graphs from cut-set sizes