HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM

DOI10.1142/S0218195900000279MaRDI QIDQ4762909zbMATH OpenOpenAlexFDO

Authors

Publication date 22 February 2001

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195900000279

zbMATH Keywords

graph isomorphism2-complex homeomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Homeomorphism of 2-Complexes is Graph Isomorphism Complete
• scientific article; zbMATH DE number 4011932
• Compatible topologies on graphs: an application to graph isomorphism problem complexity
• Graph isomorphism and equality of simplices
• Testing homotopy equivalence is isomorphism complete

Cites work

• Finite Surfaces a Study of Finite 2-Complexes
• Finite Surfaces. A Study of Finite 2-Complexes

Cited in

(6)

• scientific article; zbMATH DE number 4011932 (Why is no real title available?)
• Embedding graphs into two-dimensional simplicial complexes
• Compatible topologies on graphs: an application to graph isomorphism problem complexity
• Homeomorphism of 2-Complexes is Graph Isomorphism Complete
• Testing homotopy equivalence is isomorphism complete
• scientific article; zbMATH DE number 7662167 (Why is no real title available?)

This page was built for publication: HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM

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