The Collection of
Computer Science Bibliographies

Bibliography on Dynamic Graph Algorithms

[   About   |  Browse   |   Statistics   ]

Number of references:422Last update:August 27, 1997
Number of online publications:4Supported:Unknown
Most recent reference:1996

Information on the Bibliography

David Eppstein <eppstein @ ics . uci . edu> (email mangled to prevent spamming)
Dept. of Information and Computer Science
University of California
Irvine, CA 92717-3425
In many applications of graph algorithms, including communication networks, graphics, and VLSI design, one encounters graphs subject to discrete changes: edges or vertices may be added or removed. In other situations such as network flow algorithms, the initial graph may be static but solution methods involve transformations to a sequence of related graphs. This bibliography file cites recent papers that have been devoted to algorithms for such dynamically changing graphs, along with some other related work used in these papers and papers on applications of dynamic graph algorithms. It also includes a number of papers on dynamic methods in computational geometry.
dynamic graph algorithms, data structures, computational geometry, connectivity, minimum spanning tree, shortest path, competitive analysis, Steiner trees, incremental computation, incremental compilation, graph separators, sparsification, planarity testing, union-find

Browsing the bibliography

Bibliographic Statistics

article(210), inproceedings(153), book(21), phdthesis(12), techreport(12), incollection(7), unpublished(6), misc(1)
author(422), title(422), year(421), pages(356), journal(208), volume(200), booktitle(163), publisher(69), note(42), institution(12), number(12), school(12), editor(7), month(5), abstract(3)
Distribution of publication dates:
Distribution of publication dates

Valid XHTML 1.1!  Valid CSS!