scientific article; zbMATH DE number 1875438

zbMath1006.68544MaRDI QIDQ4796197

Frances A. Rosamond, Michael T. Hallett, Giuseppe Liotta, Vida Dujmović, Catherine McCartin, Naomi Nishimura, Matthew Suderman, David R. Wood, Michael R. Fellows, Matthew Kitching, S. H. Whitesides, Prabhakar Ragde

Publication date: 2 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610488

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Algorithms for multi-level graph planarity testing and layout ⋮ Characterization of unlabeled level planar trees ⋮ Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ On the parameterized complexity of layered graph drawing ⋮ Comparing trees via crossing minimization ⋮ \(k\)-spine, 1-bend planarity ⋮ Minimum-Layer Drawings of Trees ⋮ Connecting the dots (with minimum crossings)

This page was built for publication: