Algorithmic graph embeddings

DOI10.1016/S0304-3975(96)00273-3zbMath0901.68149WikidataQ29026733 ScholiaQ29026733MaRDI QIDQ1391310

Jian'er Chen

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

EXTENDING THE DOUBLY LINKED FACE LIST FOR THE REPRESENTATION OF 2-PSEUDOMANIFOLDS AND 2-MANIFOLDS WITH BOUNDARIES ⋮ A note on approximating graph genus ⋮ Genus characterizes the complexity of certain graph problems: Some tight results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the computational power of pushdown automata
• 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
• Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems

This page was built for publication: Algorithmic graph embeddings