Reconstructing a Graph from its Neighborhood Lists
From MaRDI portal
Publication:4290082
DOI10.1017/S0963548300000535zbMath0792.05104OpenAlexW2024530086MaRDI QIDQ4290082
Eberhard Triesch, Martin Aigner
Publication date: 12 July 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300000535
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Realizability and uniqueness in graphs ⋮ On the complexity of reconstructing H-free graphs from their Star Systems ⋮ Reconstructing trees from digitally convex sets ⋮ Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Neighborhood hypergraphs of digraphs and some matrix permutation problems ⋮ On the Complexity of Reconstructing H-free Graphs from Their Star Systems ⋮ Reconstructing Cactus Graphs from Shortest Path Information
Cites Work
