Counting edge crossings in a 2-layered drawing

Information Processing Letters

Volumn 91, Issue 5, 2004, Pages 221-225

  Nagamochi, Hiroshi ^a   Yamada, Nobuyasu ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

Bipartite graphs; Counting; Divide and conquer; Dynamic programming; Edge crossings; Graph algorithms; Graph drawing

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; GRAPH THEORY; ITERATIVE METHODS; MERGING; PROBLEM SOLVING; SET THEORY;

BIPARTITE GRAPHS; DIVIDE AND CONQUER; DYNAMIC PROGRAMMING (DP); EDGE CROSSINGS; GRAPH ALGORITHMS; GRAPH DRAWING;

DATA PROCESSING;

EID: 3242726789     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.05.001     Document Type: Article

References (6)

1. Barth W., Jünger M., Mutzel P. Simple and efficient bilayer cross counting. Lecture Notes in Comput. Sci. vol. 2528:2002;130-141 Springer, Berlin.
2. Eades P., Wormald N.C. Edge crossing in drawing bipartite graphs. Algorithmica. 11:1994;379-403.
3. Jünger M., Mutzel P. 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1:1997;1-25.
4. Sugiyama K. Graph Drawing and Applications: For Software and Knowledge Engineerings. Chang S.K. Series of Software Engineering and Knowledge Engineering. vol. 11:2002;World Scientific, Singapore.
5. Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics. 11:1981;109-125.
6. Waddle V., Malhotra A. An ElogE line crossing algorithm for levelled graphs. Lecture Notes in Comput. Sci. vol. 1731:1999;59-70 Springer, Berlin.