In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes

From MaRDI portal

Revision as of 23:03, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3507751

Jump to:navigation, search

DOI10.1145/1064546.1180618zbMath1143.05332OpenAlexW2037266436MaRDI QIDQ3507751

Nikola S. Nikolov, Juergen Branke, Alexandre Tarassov

Publication date: 20 June 2008

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A Generalization of the Directed Graph Layering Problem ⋮ Compact Layered Drawings of General Directed Graphs ⋮ Drawing Graphs with GLEE

This page was built for publication: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3507751&oldid=16861947"