Crossing reduction by windows optimization

DOI10.1007/3-540-36151-0_27MaRDI QIDQ4422288zbMATH OpenFDO

Authors Thomas Eschbach, Wolfgang Günther, Rolf Drechsler, Bernd Becker

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280285.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Applying crossing reduction strategies to layered compound graphs
• A heuristic for bottleneck crossing minimization and its performance on general crossing minimization, hypothesis and experimental study
• Graph-Theoretic Concepts in Computer Science
• Graph Drawing
• Global k-level crossing reduction

Cited in

(5)

• Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
• Are crossings important for drawing large graphs?
• k-level crossing minimization is NP-hard for trees
• Applying crossing reduction strategies to layered compound graphs
• Crossing edge minimization in radial outerplanar layered graphs using segment paths

This page was built for publication: Crossing reduction by windows optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422288)