Two-dimensional packing algorithms for layout of disconnected graphs

DOI10.1016/S0020-0255(02)00183-4MaRDI QIDQ1857089zbMATH OpenOpenAlexFDO

Authors 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, http://hdl.handle.net/11693/24693

zbMATH Keywords

graph layoutgraph visualizationtwo-dimensional packing

Mathematics Subject Classification ID

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

Recommendations

• Disconnected graph layout and the polyomino packing approach
• Two-Dimensional Finite Bin-Packing Algorithms
• Denser packings obtained in O(n n) time
• Algorithms and Computation
• Packings in two dimensions: Asymptotic average-case analysis of algorithms

Cites work

• Algorithms for drawing graphs: An annotated bibliography
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• Orthogonal Packings in Two Dimensions
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Probabilistic analysis of optimum partitioning

Cited in

(3)

• A new algorithm for removing node overlapping in graph visualization
• Disconnected graph layout and the polyomino packing approach
• The layout problem of two kinds of graph elements with performance constraints and its optimality conditions

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

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