Errors in graph embedding algorithms

DOI10.1016/J.JCSS.2010.06.002MaRDI QIDQ632808zbMATH OpenOpenAlexFDO

Authors Wendy Myrvold, William Kocay

Publication date 28 March 2011

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2010.06.002

zbMATH Keywords

torusalgorithmgraph embeddinggraph genus

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• scientific article; zbMATH DE number 1256757
• Algorithmic graph embeddings
• scientific article; zbMATH DE number 4142064
• scientific article; zbMATH DE number 867666

Cites work

• scientific article; zbMATH DE number 2186718 (Why is no real title available?)
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 3914341 (Why is no real title available?)
• scientific article; zbMATH DE number 1256757 (Why is no real title available?)
• scientific article; zbMATH DE number 3208815 (Why is no real title available?)
• scientific article; zbMATH DE number 2188433 (Why is no real title available?)
• scientific article; zbMATH DE number 6472634 (Why is no real title available?)
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• A new planarity test
• An algorithm for imbedding cubic graphs in the torus
• An efficient algorithm for determining whether a cubic graph is toroidal
• Efficient Planarity Testing
• Embedding graphs in the torus in linear time
• Fast generation of cubic graphs
• Graph Drawing
• Graphs on surfaces
• Graphs, Algorithms, and Optimization
• Note on Hopcroft and Tarjan's Planarity Algorithm
• Projective Planarity in Linear Time

Cited in

(5)

• Practical graph isomorphism. II.
• Algorithms for the workflow satisfiability problem engineered for counting constraints
• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• Stronger ILPs for the Graph Genus Problem.
• A large set of torus obstructions and how they were discovered

This page was built for publication: Errors in graph embedding algorithms

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