On the computational complexity of edge concentration

DOI10.1016/S0166-218X(99)00207-3zbMath0953.68119OpenAlexW1984849634MaRDI QIDQ1975372

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for drawing graphs: An annotated bibliography
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Crossing Theory and Hierarchy Mapping
• AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH

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