Algorithms – ESA 2004
From MaRDI portal
Publication:5464575
DOI10.1007/b100428zbMath1111.68563MaRDI QIDQ5464575
No author found.
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Upward planar drawings with two slopes, Upward Planar Drawings with Three and More Slopes, Testing upward planarity of partial 2-trees, Grid recognition: classical and parameterized computational perspectives, Maximum upward planar subgraphs of embedded planar digraphs, Improving the running time of embedded upward planarity testing, Orthogonal planarity testing of bounded treewidth graphs, Upward planar drawings with three and more slopes, Quasi-upward planar drawings with minimum curve complexity, Parameterized analysis and crossing minimization problems, Sketched representations and orthogonal planarity of bounded treewidth graphs, Upward and quasi-upward planarity testing of embedded mixed graphs, Upward Planarity Testing in Practice, An Improved Upward Planarity Testing Algorithm and Related Applications