Output-sensitive algorithm for the edge-width of an embedded graph

DOI10.1145/1810959.1810987zbMath1284.05179OpenAlexW2133225996MaRDI QIDQ5405877

Éric Colin de Verdière, Francis Lazarus, Sergio Cabello

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1810959.1810987

zbMATH Keywords

surfaceface-widthembedded graphcomputational topologyedge-widthtopological graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Unnamed Item

This page was built for publication: Output-sensitive algorithm for the edge-width of an embedded graph