Incremental bipartite drawing problem

Computers and Operations Research

Volumn 28, Issue 13, 2001, Pages 1287-1298

  Martí, Rafael ^a   Estruch, Vicente ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Combinatorial optimization; Graph drawing; Heuristic search

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; OPTIMIZATION;

BIPARTITE GRAPHS;

OPERATIONS RESEARCH;

INFORMATION SYSTEM; METHODOLOGY;

EID: 0035502164     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00040-X     Document Type: Article

References (13)

1. The NP-completeness column: An ongoing guide
2. Automatic display of hierarchized graphs for computer aided decision analysis
3. Methods for visual understanding of hierarchical system structures
4. The assignment heuristic for crossing reduction
5. A tabu search algorithm for the bipartite drawing problem
6. GRASP and path relinking for 2-layer straight line crossing minimization
7. A branch and bound algorithm for arc crossing minimization in bipartite graphs
8. Greedy randomized adaptive search procedures
9. A probabilistic heuristic for a computationally difficult set covering problem
10. Exact and heuristic algorithms for 2-layer straight line crossing minimization