Acyclic orientation of drawings

Authors:
Eyal Ackerman;Kevin Buchin;Christian Knauer;Günter Rote
Affiliations:
Department of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel;Institute of Computer Science, Freie Universität Berlin, Berlin, Germany;Institute of Computer Science, Freie Universität Berlin, Berlin, Germany;Institute of Computer Science, Freie Universität Berlin, Berlin, Germany
Venue:
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Year:
2006

Citing 6
Cited 0

Algorithms for visibility representations of planar graphs

3rd annual symposium on theoretical aspects of computer science on STACS 86
Two algorithms for maintaining order in a list

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Graph Algorithms

Graph Algorithms
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Algorithms for graphs embeddable with few crossings per edge

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of curves in the plane or a topological graph, we ask for an orientation of the curves or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a curve or an edge, we provide algorithms and hardness proofs for this problem