Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis

Carpano, Marie-Jose

doi:10.1109/tsmc.1980.4308390

Cited by 94 publications

(39 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problem of minimizing straight-line crossings in layered graphs has been the subject of study for at least 17 years, beginning with the Relative Degree Algorithm introduced by Carpano [2] . The problem consists of aligning the two shores V 1 and V 2 of a bipartite graph G = (V 1 , V 2 , E) on two parallel straight lines (layers) such that the number of crossing between the edges in E is minimized when the edges are drawn as straight lines connecting the end-nodes (Jünger and Mutzel, 1997).…”

mentioning

confidence: 99%

“…In some instances, however, LPP procedures have been extended to the BDP case, in a similar way that 2-layer graph methods have been adapted to the multi-layer case. Reference Procedure Comments Carpano [2] Relative degree algorithm Sugiyama, et al [21] Barycenter Similar to Carpano's. Eades and Kelly [4] Greedy insertion Splitting Averaging Greedy switching Same as barycenter.…”

mentioning

confidence: 99%

See 1 more Smart Citation

GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

Laguna

Martı́

1999

INFORMS Journal on Computing

271

105

View full text Add to dashboard Cite

-In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight-line crossings in a 2-layer graph. The procedure is fast and is particularly appealing when dealing with low-density graphs. When a modest increase in computational time is allowed, the procedure may be coupled with a path relinking strategy to search for improved outcomes. Although the principles of path relinking have appeared in the tabu search literature, this search strategy has not been fully implemented and tested. We perform extensive computational experiments with more than 3,000 graph instances to first study the effect of changes in critical search parameters and then to compare the efficiency of alternative solution procedures. Our results indicate that graph density is a major influential factor on the performance of a solution procedure.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

Laguna

Martı́

1999

INFORMS Journal on Computing

271

105

View full text Add to dashboard Cite

show abstract

“…The importance of reducing the visual complexity of the overall graph is addressed in [2] and [16], where sophisticated and hierarchical displays are considered. These approaches are based solely on altering the display of a graph, without removing any elements from the graph or otherwise reducing the complexity of the underlying graph itself.…”

Section: Related Workmentioning

confidence: 99%

Reduction of visual complexity in dynamic graphs

et al. 1995

View full text Add to dashboard Cite

Abstract. Graphs are used extensively in software visualization to represent both static aspects of software structure and dynamic aspects of execution-time behavior. However, for realistic subject software systems, there are far too many nodes and edges in the displayed graphs to be comprehensible to an end user. Further, for presentation of dynamics, continual change and redisplay of such large graphs is too demanding for conventional workstation computational resources. This paper poses the problem of "reduction" or "abstraction" in dynamically changing graphs, and proposes a combination of techniques that can be used to reduce the visual complexity of a graph, without obscuring the significant information that it was meant to convey. The abstract graph can be comprehended more readily and it changes far less frequently than the full graph. As well, when the abstract graph does change, it requires far less computation for layout and redisplay. These abstraction techniques are illustrated by way of examples showing their use in systems for visualization of object-oriented and multi-layer software systems.

show abstract

“…A common method was introduced by Sugiyama, Tagawa and Toda [25] and by Carpano [4]. Several closely related methods were proposed later (see e.g.…”

Section: Introductionmentioning

confidence: 99%

Confluent Layered Drawings

2005

View full text Add to dashboard Cite

Abstract. We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed style drawings. The basic idea is to cover a layered graph by complete bipartite subgraphs (bicliques), then replace bicliques with tree-like structures. The biclique cover problem is reduced to a special edge coloring problem and solved by heuristic coloring algorithms. Our method can be extended to obtain multi-depth confluent layered drawings.

show abstract

Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis

Cited by 94 publications

References 4 publications

GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

Reduction of visual complexity in dynamic graphs

Confluent Layered Drawings

Contact Info

Product

Resources

About