Heuristics for laying out information graphs

DOI10.1007/BF02276884zbMath0808.68059OpenAlexW1555302386MaRDI QIDQ1332692

Lenwood S. Heath, Joseph L. Ganley

Publication date: 1 September 1994

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02276884

zbMATH Keywords

object-oriented databasesinformation graphretrieval layout problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph theory (05C99) Information storage and retrieval of data (68P20)

Related Items (1)

An experimental evaluation of local search heuristics for graph partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithms for bin packing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Tabu Search—Part I
• An efficient heuristic cluster algorithm for tearing large-scale networks

This page was built for publication: Heuristics for laying out information graphs