Irene Finocchi  Home/Search
Context
Related
| gauguin.info.uniroma2.i...PhDThesis.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: gauguin.info.uniro...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this thesis we study algorithmic problems related to the visualization of large graphs. We devise techniques based on hierarchical decompositions, imposed either on the graph or on its drawing. The first approach leads to considering clustered representations of graphs, where some parts are visualized in detail and others are collapsed into single vertices or filled-in regions: this makes it possible both to maintain context and to reduce the amount of displayed information by hiding... (Update)
Similar documents (at the sentence level):
9.1%: Hierarchical Decompositions for Visualizing Large Graphs - Finocchi (2002) (Correct)
7.1%: Removing Cycles for Minimizing Crossings - Demetrescu, Finocchi (2001) (Correct)
Active bibliography (related documents): More All
0.8: Combinatorial Algorithms for Feedback Problems in Directed.. - Demetrescu, Finocchi (Correct)
0.8: Combinatorial Algorithms for Feedback Problems - In Directed Graphs (Correct)
0.8: Break the "Right" Cycles and Get the "Best" - Drawing Camil Demetrescu (Correct)
Similar documents based on text: More All
0.6: Fully Dynamic Algorithms for Path Problems on Directed Graphs - Demetrescu (Correct)
0.5: On Max Cut in Cubic Graphs - Tiziana Calamoneri Irene (Correct)
0.4: Transformation of Constraint Logic Programs for Software.. - Fioravanti (2002) (Correct)
BibTeX entry: (Update)
@misc{ finocchi-hierarchical,
author = "Irene Finocchi",
title = "Hierarchical Decompositions for Visualizing Large Graphs",
url = "citeseer.ist.psu.edu/finocchi02hierarchical.html" }
Citations (may not include all citations):4212 Computers and Intractability: a Guide to Theory of NP-comple.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
773 Reducibility among combinatorial problems (context) - Karp - 1972
576 Authoritative sources in a hyperlinked environment - Kleinberg - 1999
474 Graph Theory (context) - Harary - 1969
318 Approximations Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
314 An Introduction to Parallel Algorithms (context) - aj - 1992
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
291 Generalized fisheye views (context) - Furnas - 1986
275 Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993
219 Bounds for multiprocessing timing anomalies (context) - Graham - 1969
218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
185 Methods for visual understanding of hierarchical system stru.. (context) - Sugiyama, Tagawa et al. - 1981
177 Software: Practice and Experience (context) - Paulish, Tichy - 1990
175 Cone trees: animated 3D visualizations of hierarchical infor.. (context) - Robertson, Mackinlay et al. - 1991
135 and graph planarity using PQ-tree algorithms (context) - Booth, Lueker - 1976
131 Graph Drawing: Algorithms for the Visualization of Graphs (context) - Di Battista, Eades et al. - 1999
118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
117 The small world problem (context) - Milgram - 1967
94 Clustering to minimize the maximum intercluster distance (context) - Gonzalez - 1985
87 The Stanford GraphBase: A platform for combinatorial computi.. (context) - Knuth - 1993
79 Graphical fisheye views - Sarkar, Brown - 1994
74 Divide-and-conquer approximation algorithms via spreading me.. - Even, Naor et al. - 1995
73 Distance in graphs (context) - Buckley, Harary - 1990
67 Optimal algorithms for approximate clustering (context) - Feder, Greene - 1988
66 Optimal scheduling for two processor systems (context) - Coffman, Graham - 1972
64 A technique for drawing directed graphs - Gansner, Koutsofios et al. - 1993
61 Ratio cut partitioning for hierarchical designs (context) - Wei, Cheng - 1991
60 Layout adjustment and the mental map (context) - Misue, Eades et al. - 1995
58 Edge crossings in drawings of bipartite graphs (context) - Eades, Wormald - 1994
56 How to draw a directed graph (context) - Eades, Sugiyama - 1991
49 Multilevel visualization of clustered graphs - Eades, Feng - 1997
48 the exponent of the all pairs shortest path problem (context) - Alon, Galil et al. - 1997
42 Packing directed circuits fractionally (context) - Seymour - 1995
36 Matrix Market: a web resource for test matrix collections - Boisvert, Pozo et al. - 1997
32 A local-ratio theorem for approximating the weighted vertex .. (context) - Bar-Yehuda, Even - 1985
31 layer straightline crossing minimization: Performance of exa.. (context) - unger, Mutzel - 1997
28 Fast estimation of diameter and shortest paths (context) - Aingworth, Chekuri et al. - 1999
26 How to draw a planar clustered graph (context) - Feng, Cohen et al. - 1995
26 Automatic display of hierarchized graphs for computeraided d.. (context) - Carpano - 1980
25 A fast multi-scale method for drawing large graphs (context) - Harel, Koren - 2000
25 Some NP-complete problems on graphs (context) - Gavril - 1977
24 Planar graphs: Theory and algorithms (context) - Nishizeki, Chiba - 1988
24 Heuristics for reducing crossings in 2layered networks (context) - Eades, Kelly - 1986
24 Reversible execution and visualization of programs with Leon.. - Crescenzi, Demetrescu et al. - 2000
23 Human-guided simple search - Anderson, Anderson et al. - 2000
23 the all-pairs-shortest-path problem in unweighted undirected.. (context) - Seidel - 1995
22 cient planarity testing (context) - Hopcroft, Tarjan - 1974
22 Crossing theory and hierarchy mapping (context) - Warfield - 1977
22 Finding level ancestors in trees (context) - Berkman, Vishkin - 1994
21 Planarity for clustered graphs (context) - Feng, Cohen et al. - 1995
20 Level Planarity Testing and Embedding in Linear Time (context) - Leipert - 1998
20 Towards a discipline of experimental algorithmics - Moret - 1996
19 String graphs II: Recognizing string graphs is NP-hard (context) - il - 1991
19 Theoretical Computer Science (context) - Eades, Whitesides - 1994
19 Maintaining hierarchical graph views (context) - Buchsbaum, Westbrook - 2000
18 The assignment heuristic for crossing reduction - Catarci - 1995
17 Edge concentration: a method for clustering directed graphs (context) - Newbery - 1989
16 A branch and bound algorithm for minimizing the number of cr.. (context) - Valls, Marti et al. - 1996
16 Approximation algorithms for the maximum acyclic subgraph pr.. (context) - Berger, Shor - 1990
15 Balanced aspect ratio trees and their use for drawing very l.. - Duncan, Goodrich et al. - 2000
15 Worst case analysis of memory allocation algorithms (context) - Garey, Graham et al. - 1972
15 Total ordering problem (context) - Opatrny - 1979
14 An experimental study of the basis for graph drawing algorit.. (context) - Purchase, Cohen et al. - 1997
14 Clustering techniques for minimizing external path length - Diwan, Rane et al. - 1996
13 A fully animated interactive system for clustering and navig.. (context) - Huang, Eades - 1998
13 A new heuristic layout algorithm for dags (context) - Dresbach - 1994
12 Drawing clustered graphs on an orthogonal grid - Eades, Feng et al. - 1999
12 ective heuristic for the feedback arc set problem (context) - Eades, Lin et al. - 1993
12 An approximation algorithm for the two-layered graph drawing.. (context) - Yamaguchi, Sugimoto - 1999
12 Approximations for the maximum acyclic subgraph problem - Hassin, Rubinstein - 1994
11 Visualizing large trees using the hyperbolic browser (context) - Lamping, Rao - 1994
11 A multi-scale method for drawing graphs nicely (context) - Hadany, Harel - 1999
10 The profile minimization problem in trees (context) - Kuo, Chang - 1994
10 Worst case analysis of two scheduling algorithms (context) - Lam, Sethi - 1977
9 One for the price of two: A unified approach for approximati.. (context) - Bar-Yehuda - 1998
9 Planaritypreserving clustering and embedding for large plana.. - Duncan, Goodrich et al. - 1999
9 A new heuristic for the feedback arc set problem (context) - Eades, Lin - 1995
9 layer straightline crossing minimization (context) - Matuszewski, Sch et al. - 1999
8 Selecting problems for algorithm evaluation (context) - Goldberg - 1999
8 La Sapienza (context) - Demetrescu, Finocchi - 1999
8 The shifting algorithm technique for the partitioning of tre.. (context) - Becker, Perl - 1995
8 Who is interested in algorithms and why (context) - Skiena - 1998
8 A shifting algorithm for constrained min-max partition of tr.. (context) - Agasi, Becker et al. - 1993
8 Experiments in drawing 2-level hierarchical graphs (context) - Makinen - 1988
7 Approximate Solution of NP-Hard Optimization Problems (context) - Ausiello, Crescenzi et al. - 1999
7 Partitioning approach to visualization of large graphs (context) - Batagelj, Mrvar et al. - 1999
7 cycles and get (context) - Demetrescu, Finocchi - 2000
6 Noncrossing subgraphs of topological layouts (context) - il, Lubiw et al. - 1991
6 A library of algorithms for graph drawing (context) - Mutzel, Gutwenger et al. - 1998
6 Max-min tree partitioning (context) - Perl, Schach - 1981
6 Volume 50 of the AMS-DIMACS Series on Discrete Mathematics a.. (context) - Abello, Vitter - 1999
6 Smooth animation of algorithms in a declarative framework - Demetrescu, Finocchi - 2001
6 Visualization in algorithm engineering: Tools and techniques - Demetrescu, Finocchi et al.
6 the nature of structure and its identification (context) - Stein, Niggeman - 1999
6 Exact and heuristic algorithms for the weighted feedback arc.. (context) - Flood - 1990
6 A bibliography of algorithm experimentation - McGeoch - 1996
5 Notes on Hopcroft and Tarjan's planarity algorithm (context) - Deo - 1976
4 Approximations to clustering and subgraphs problems on trees (context) - Schrader - 1983
4 Some properties of a centroid of a free tree (context) - Kang, Ault - 1975
4 Most uniform path partitioning and its use in image processi.. (context) - Lucertini, Perl et al. - 1993
4 Graph sketches (context) - Abello, Finocchi et al. - 2001
4 Interactive partitioning (context) - Lesh, Marks et al. - 2000
3 Crossing number of abstract topological graphs (context) - il - 1998
3 of large graphs. PhD thesis, University of Rome "La Sapienza (context) - Patrignani - 2001
3 Spine tree decomposition (context) - Benkoczi, Bhattacharya - 1999
3 Available ftpftp (context) - graphs, ftp et al. - 1995
2 Layered drawings of graphs with crossing constraints (context) - Finocchi - 2001
2 Clustering in trees: Optimizing cluster sizes and number of .. - Hambrusch, Liu et al. - 2000
2 Width restricted layering of acyclic digraphs with considera.. - Branke, Leppert et al. - 2002
2 the validity of hierarchical decompositions - Finocchi, Petreschi - 2001
2 the power of BFS to determine a graph diameter (context) - Corneil, Dragan et al. - 2002
2 cient implementation of a shifting algorithm (context) - Perl, Vishkin - 1985
2 Generation of large bipartite subgraphs in cubic graphs (context) - Calamoneri, Finocchi et al. - 1999
2 A parallel approximation algorithm for the max cut problem o.. - Calamoneri, Finocchi et al. - 1999
2 Infinite trees and the future - Demetrescu, Di Battista et al. - 1999
2 Hierarchical clustering of trees: Algorithms and experiments - Finocchi, Petreschi - 2001
2 Tree partitioning via vertex deletion (context) - Finocchi, Petreschi - 2001
2 Parallel Algorithms and Applications (context) - Calamoneri, Finocchi et al.
Documents on the same site (http://gauguin.info.uniroma2.it/~finocchi/publications.html): More
Combinatorial Algorithms for Feedback Problems in Directed.. - Demetrescu, Finocchi (Correct)
On Max Cut in Cubic Graphs - Calamoneri, Finocchi, Petreschi.. (Correct)
A Portable Virtual Machine for Program Debugging and Directing - Demetrescu, Finocchi (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC