Pages that link to "Item:Q4145508"
From MaRDI portal
The following pages link to Crossing Theory and Hierarchy Mapping (Q4145508):
Displayed 22 items.
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- A method for aggregating ordinal assessments by a majority decision rule (Q1168198) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- Graph layout for applications in compiler construction (Q1285776) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- A genetic algorithm for the talent scheduling problem (Q1342111) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- An algorithm for drawing general undirected graphs (Q1822997) (← links)
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842) (← links)
- On the computational complexity of edge concentration (Q1975372) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Graph layering by promotion of nodes (Q2489908) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- Genetic algorithms for drawing bipartite graphs (Q4844579) (← links)
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← links)
- Experiments on drawing 2-level hierarchical graphs (Q5895402) (← links)
- Experiments on drawing 2-level hierarchical graphs (Q5899817) (← links)