Reconstruction Algorithm for Permutation Graphs

DOI10.1007/978-3-642-11440-3_12zbMATH Open1274.05451OpenAlexW1485435623MaRDI QIDQ3404435FDOQ3404435

Authors: Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara 

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_12

Recommendations

• Graph reconstruction by permutations
• Permutation reconstruction
• A basic algorithm for graph reconstruction
• On reconstruction of graphs
• scientific article; zbMATH DE number 772776
• A reconstruction algorithm for the essential graph
• Bipartite Permutation Graphs Are Reconstructible
• Bipartite permutation graphs are reconstructible

zbMATH Keywords

permutation graphspolynomial time algorithmgraph reconstruction conjecture

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (5)

• Reconstruction of Interval Graphs
• Bipartite Permutation Graphs Are Reconstructible
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• Reconstruction of interval graphs
• Permutation reconstruction from a few large patterns

This page was built for publication: Reconstruction Algorithm for Permutation Graphs

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