Crossing Theory and Hierarchy Mapping
From MaRDI portal
Publication:4145508
DOI10.1109/TSMC.1977.4309760zbMATH Open0367.93004OpenAlexW2094450647MaRDI QIDQ4145508FDOQ4145508
Authors: John N. Warfield 
Publication date: 1977
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsmc.1977.4309760
Cited In (22)
- Genetic algorithms for drawing bipartite graphs
- Experiments on drawing 2-level hierarchical graphs
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- Graph layout for applications in compiler construction
- On the parameterized complexity of layered graph drawing
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
- On the computational complexity of edge concentration
- A method for aggregating ordinal assessments by a majority decision rule
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
- Graph layering by promotion of nodes
- An algorithm for drawing general undirected graphs
- Crossing minimization in weighted bipartite graphs
- A genetic algorithm for the talent scheduling problem
- Edge crossings in drawings of bipartite graphs
- Experiments on drawing 2-level hierarchical graphs
- Algorithms for plane representations of acyclic digraphs
- A new lower bound for the bipartite crossing number with applications
- A tabu search algorithm for the bipartite drawing problem
- ARC crossing minimization in hierarchical digraphs with tabu search
- Crossing-constrained hierarchical drawings
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: Crossing Theory and Hierarchy Mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145508)
