Two-dimensional packing algorithms for layout of disconnected graphs

DOI10.1016/S0020-0255(02)00183-4zbMath1006.68652OpenAlexW2146156581MaRDI QIDQ1857089

Ugur Dogrusoz

Publication date: 11 February 2003

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(02)00183-4

zbMATH Keywords

two-dimensional packinggraph layoutgraph visualization

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (2)

A new algorithm for removing node overlapping in graph visualization ⋮ The layout problem of two kinds of graph elements with performance constraints and its optimality conditions

Cites Work

• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• Algorithms for drawing graphs: An annotated bibliography
• Probabilistic analysis of optimum partitioning
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-dimensional packing algorithms for layout of disconnected graphs