Pankaj Agarwal, David Eppstein, Leonidas J. Guibas, Monika R. Henzinger  Home/Search
Context Related
| uci.edu/~eppstein/...EppGuiFOCS98.pdf digital.com/pub/DEC/SR...kineticweb.ps 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: uci.edu/~eppstein/pubs/all (more) From: dec.com/SRC/publicat...srcpapers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter # and wish to compute the sequence of minimum spanning trees generated as # varies. We also consider the kinetic minimum spanning tree problem, in which # represents time and the graph is subject in addition to changes such as edge insertions, deletions, and modifications of the weight functions as time progresses. We solve both problems in time O(n ... (Update)
Context of citations to this paper: More
.... points, like the closest pair, width and diameter, clusters, minimum spanning trees or the constrained Delaunay triangulation [10, 94, 6, 1, 32, 4, 55] (see also the work by Roos [87] on Voronoi diagrams for an approach that is closely related to KDS) Kinetic connectivity...
Cited by: More
Unknown - Decision Making Based (2005) (Correct)
Kinetic Minimum-Power Routing and Clustering in - Mobile Ad-Hoc Networks (Correct)
On Levels in Arrangements of Curves, II: A Simple Inequality and.. - Chan (Correct)
Active bibliography (related documents): More All
0.5: Dynamic Graph Algorithms - Eppstein, Galil, Italiano (1999) (Correct)
0.4: Dynamically Switching Vertices in Planar Graphs - Frigioni, Italiano (1999) (Correct)
0.3: Rectilinear and Polygonal p-Piercing and p-Center Problems - Micha Sharir, Emo Welzl (1996) (Correct)
Similar documents based on text: More All
0.3: Kinetic Medians and kd-Trees - Agarwal, Gao, Guibas (2002) (Correct)
0.3: Emerging Challenges in Computational Topology - Bern, Eppstein, al. (1999) (Correct)
0.2: Computational Geometry - October Brownestone (Correct)
Related documents from co-citation: More All
4: Data structures for mobile data - Basch, Guibas et al.
4: Kinetic data structures: A state of the art report - Guibas - 1998
4: How to cut pseudo-parabolas into segments (context) - Tamaki, Tokuyama - 1995
BibTeX entry: (Update)
P. K. Agarwal, D. Eppstein, L. J. Guibas, and M. R. Henzinger. Parametric and kinetic minimum spanning trees. In Proc. 39th IEEE Sympos. Found. Comput. Sci., pages 596-- 605, 1998. http://citeseer.ist.psu.edu/agarwal98parametric.html More
@inproceedings{ agarwal98parametric,
author = "Pankaj K. Agarwal and David Eppstein and Leonidas J. Guibas and Monika Rauch Henzinger",
title = "Parametric and Kinetic Minimum Spanning Trees",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "596-605",
year = "1998",
url = "citeseer.ist.psu.edu/agarwal98parametric.html" }
Citations (may not include all citations):185 Applying parallel computation algorithms in the design of se.. (context) - Megiddo - 1983
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
121 Data structures for mobile data - Basch, Guibas et al. - 1997
118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
101 Sparsification --- A technique for speeding up dynamic graph.. (context) - Eppstein, Galil et al. - 1997
80 Slowing down sorting networks to obtain faster sorting algor.. (context) - Cole - 1987
61 A separator theorem for graphs with an excluded minor and it.. (context) - Alon, Seymour et al. - 1990
54 Ambivalent data structures for dynamic 2-edge-connectivity a.. - Frederickson - 1997
41 Kinetic data structures --- a state of the art report - Guibas - 1998
37 Polylogarithmic deterministic fully-dynamic algorithms for c.. - Holm, de Lichtenberg et al. - 1998
33 the history of the minimum spanning tree problem (context) - Graham, Hell - 1985
33 Verification and sensitivity analysis of minimum spanning tr.. - Dixon, Rauch et al. - 1992
30 Planar separators and parallel polygon triangulation - Goodrich - 1995
27 A randomized linear-time algorithm for finding minimum spann.. - Karger, Klein et al. - 1995
26 Proximity problems on moving points - Basch, Guibas et al. - 1997
26 A simpler minimum spanning tree verification algorithm - King - 1995
23 Faster parametric shortest path and minimum-balance algorith.. - Young, Tarjan et al. - 1991
15 Geometric lower bounds for parametric matroid optimization - Eppstein
13 Maintaining minimum spanning trees in dynamic graphs - Henzinger, King - 1997
13 A faster deterministic algorithm for minimum spanning trees (context) - Chazelle - 1997
12 Improved bounds on planar k-sets and k-levels - Dey - 1998
4 Parametric problems on graphs of bounded tree-width (context) - andez-Baca, Slutzki - 1994
4 Separator based sparsification I: planarity testing and mini.. (context) - Eppstein, Galil et al. - 1996
3 Algorithmic techniques for geometric optimization - Agarwal, Sharir - 1995
2 Clustering for faster network simplex pivots - Eppstein - 1994
1 Parametric combinatorial optimization problems and applicati.. (context) - Katoh - 1991
1 Bicriteria network optimization problems (context) - Katoh - 1992
1 Using sparsification for parametric minimum spanning tree pr.. (context) - andez-Baca, Slutzki et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996) (Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999) (Correct)
Worst-Case Bounds for Subadditive Geometric Graphs - Bern, Eppstein (1993) (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