Crossing Theory and Hierarchy Mapping

DOI10.1109/TSMC.1977.4309760MaRDI QIDQ4145508zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

General systems theory (93A99)

Cited in

(22)

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

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)