Crossing Theory and Hierarchy Mapping

DOI10.1109/TSMC.1977.4309760zbMath0367.93004OpenAlexW2094450647MaRDI QIDQ4145508

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

Mathematics Subject Classification ID

General systems theory (93A99)

Related Items

A genetic algorithm for the talent scheduling problem, ARC crossing minimization in hierarchical digraphs with tabu search, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, Algorithms for plane representations of acyclic digraphs, Genetic algorithms for drawing bipartite graphs, On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem, A method for aggregating ordinal assessments by a majority decision rule, Representations of graphs and networks (coding, layouts and embeddings), On the computational complexity of edge concentration, Crossing-constrained hierarchical drawings, On the parameterized complexity of layered graph drawing, Graph layering by promotion of nodes, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm, Experiments on drawing 2-level hierarchical graphs, A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs, Experiments on drawing 2-level hierarchical graphs, An algorithm for drawing general undirected graphs, Graph layout for applications in compiler construction, A new lower bound for the bipartite crossing number with applications, Crossing minimization in weighted bipartite graphs, Edge crossings in drawings of bipartite graphs, A tabu search algorithm for the bipartite drawing problem