On the computational complexity of edge concentration

DOI10.1016/S0166-218X(99)00207-3MaRDI QIDQ1975372zbMATH OpenOpenAlexFDO

Authors Xuemin Lin

Publication date 9 April 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00207-3

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Drawing graphs in two layers
• Maximizing edge-ratio is NP-complete
• Edge crossings in drawings of bipartite graphs
• On the complexity of the maximum biplanar subgraph problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
• Algorithms for drawing graphs: An annotated bibliography
• Crossing Theory and Hierarchy Mapping
• Graph theory
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Cited in

(2)

• Complexity of edge monitoring on some graph classes
• Node and edge averaged complexities of local graph problems

This page was built for publication: On the computational complexity of edge concentration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975372)