A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke. A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. In Celso C. Ribeiro, Simone L. Martins, editors, Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings. Volume 3059 of Lecture Notes in Computer Science, pages 570-583, Springer, 2004. [doi]

The following publications are possibly variants of this publication:

In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodesNikola S. Nikolov, Alexandre Tarassov, Jürgen Branke. jea, 10, 2005. [doi]

Width-restricted layering of acyclic digraphs with consideration of dummy nodesJürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades. ipl, 81(2):59-63, 2002. [doi]

Graph layering by promotion of nodesNikola S. Nikolov, Alexandre Tarassov. DAM, 154(5):848-860, 2006. [doi]

runs on WebDSL