scientific article; zbMATH DE number 512923

MaRDI QIDQ4281636zbMATH OpenFDO

Authors Jianer Chen

Publication date 10 March 1994

zbMATH Keywords

average genusgraph isomorphismlinear time algorithmtopological invariants

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
• A linear-time algorithm for isomorphism of a subclass of chordal graphs
• On the average genus of a graph
• Graph isomorphism in quasipolynomial time (extended abstract)
• Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
• On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism
• On the generic complexity of the searching graph isomorphism problem
• scientific article; zbMATH DE number 3860408
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
• Generic case complexity of the graph isomorphism problem

Cited in

(3)

• A tight lower bound on the maximum genus of a simplicial graph
• A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
• Graph ear decompositions and graph embeddings

This page was built for publication:

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