๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristics for laying out information graphs

โœ Scribed by J. L. Ganley; L. S. Heath

Publisher
Springer Vienna
Year
1994
Tongue
English
Weight
975 KB
Volume
52
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Simple heuristics for unit disk graphs
Simple heuristics for unit disk graphs
โœ M. V. Marathe; H. Breu; H. B. Hunt III; S. S. Ravi; D. J. Rosenkrantz ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 990 KB
Heuristics for Semirandom Graph Problems
Heuristics for Semirandom Graph Problems
โœ Uriel Feige; Joe Kilian ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

We consider semirandom graph models for finding large independent sets, colorings, and bisections in graphs. These models generate problem instances by blending random and adversarial decisions. To generate semirandom independent set problems, an independent set S of an vertices is randomly chosen.

Heuristic graph displayer for G-Base
Heuristic graph displayer for G-Base
โœ Hiroyuki Watanabe ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science โš– 776 KB

A proto-type graph displaying system for a data base management system is described. The system uses a heuristic algorithm for drawing a graph. The system was developed to draw a schema graph for the G-Base-Data Base Management System based on a graph data model. For quiek display, the algorithm use

Parallel Heuristics for Improved, Balanc
Parallel Heuristics for Improved, Balanced Graph Colorings
โœ Robert K. Gjertsen; Jr.; Mark T. Jones; Paul E. Plassmann ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 399 KB

The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under