Marcus Raitner  Home/Search
Context Related
| infosun.fmi.unipassau.d...preprint.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: infosun.fmi.unipassau.de/~rai... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Range searching over tree cross products is a variant of classic range searching, recently introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, pp. 120--131, 2000). A tree cross product consist of hyperedges connecting the nodes of trees T1 , . . . , Td . In this context, range searching means to determine all hyperedges connecting a given set of tree nodes. Buchsbaum et al. describe a data structure which supports, besides queries, adding and removing of edges; the tree... (Update)
Cited by: More
Visual Navigation of Compound Graphs - Raitner (Correct)
Active bibliography (related documents): More All
2.0: Dynamic Tree Cross Products - Raitner (2004) (Correct)
0.8: Maintaining Hierarchical Graph Views for Dynamic Graphs - Raitner (2004) (Correct)
0.6: An Adaptable Data Structure for Dynamic Hierarchies on Graphs - Raitner (Correct)
Similar documents based on text: More All
0.5: Open Problems Wiki - Raitner (Correct)
0.5: Range Searching Over Tree Cross Products - Buchsbaum, Goodrich, Westbrook (2000) (Correct)
0.3: HGV: A Library for Hierarchies, Graphs, and Views - Raitner (2002) (Correct)
Related documents from co-citation: More All
2: A Fully Animated Interactive System for Clustering and Navigating Huge Graphs (context) - Huang, Eades - 1998
2: Visualization of structural information: Automatic drawing of compound digraphs (context) - Sugiyama, Misue - 1991
2: Range searching over tree cross products - Buchsbaum, Goodrich et al. - 2000
BibTeX entry: (Update)
Raitner, M.: Dynamic tree cross products. In: Proc. 15th ISAAC. LNCS. (2004) http://citeseer.ist.psu.edu/article/raitner04dynamic.html More
@misc{ raitner04dynamic,
author = "M. Raitner",
title = "Dynamic tree cross products",
text = "Raitner, M.: Dynamic tree cross products. In: Proc. 15th ISAAC. LNCS. (2004)",
year = "2004",
url = "citeseer.ist.psu.edu/article/raitner04dynamic.html" }
Citations (may not include all citations):140 On visual formalisms - Harel - 1988
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
59 Visualization of structural information: Automatic drawing o.. (context) - Sugiyama, Misue - 1991
29 Design and implementation of an e#cient priority queue (context) - Boas, Kaas et al. - 1977
26 How to draw a planar clustered graph (context) - Feng, Cohen et al. - 1995
22 Finding level ancestors in trees (context) - Berkman, Vishkin - 1994
19 Maintaining hierarchical graph views (context) - Buchsbaum, Westbrook - 2000
16 Two simplified algorithms for maintaining order in a list - Bender, Richard et al. - 2002
14 Finding level ancestors in dynamic trees (context) - Dietz - 1991
13 Good worst-case algorithms for inserting and deleting record.. (context) - Willard - 1986
10 Range searching over tree cross products - Buchsbaum, Goodrich et al. - 2000
9 A graph model which supports flexible layout functions - Lai, Eades - 1996
9 HGV: A library for hierarchies (context) - Raitner - 2002
7 Improved algorithms for finding level ancestors in dynamic t.. - Alstrup, Holm - 2000
4 Biopath--- exploration and visualization of biochemical path.. - Brandenburg, Forster et al. - 2003
4 The level ancestor problem simplified (context) - Bender, Farach-Colton - 2002
3 Personal communication (context) - Buchsbaum
3 Maintaining hierarchical graph views for dynamic graphs - Raitner - 2004
Documents on the same site (http://www.infosun.fmi.uni-passau.de/~raitner/): More
Visual Navigation of Compound Graphs - Raitner (Correct)
Gravisto: Graph Visualization Toolkit - Bachmaier, Brandenburg, Forster.. (2004) (Correct)
An Adaptable Data Structure for Dynamic Hierarchies on Graphs - Raitner (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