Pages that link to "Item:Q4381060"
From MaRDI portal
The following pages link to 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (Q4381060):
Displayed 18 items.
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
- Counting edge crossings in a 2-layered drawing (Q2390316) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
- (Q4789076) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)