Algorithmic graph embeddings

DOI10.1007/bfb0030829zbMath1527.68158MaRDI QIDQ6085703

Jian'er Chen

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Designing networks with compact routing tables
• An algorithm for imbedding cubic graphs in the torus
• Limit points for average genus. II: 2-connected non-simplicial graphs
• Kuratowski-type theorems for average genus
• Algorithms for drawing graphs: An annotated bibliography
• Maximum genus and connectivity
• The graph genus problem is NP-complete
• Hierarchy for imbedding-distribution invariants of a graph
• Efficient Planarity Testing
• Graph Ear Decompositions and Graph Embeddings
• Projective Planarity in Linear Time
• A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
• On the complexity of graph embeddings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic graph embeddings