Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Alberts, David
Cattaneo, G
Italiano, Giuseppe
Nanni, Umberto
Zaroliagis, Christos

dblp
dblp
dblp
dblp
dblp



Editor(s):

Battiti, R
Bertosi, A

dblp
dblp



BibTeX cite key*:

Alberts-et-al-98

Title, Booktitle

Title*:

A Software Library of Dynamic Graph Algorithms

Booktitle*:

Proceedings of Workshop on Algorithms and Experiments (ALEX-98)

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Trento, Italy

Language:

English

Event Date*
(no longer used):

February, 9-11

Organization:


Event Start Date:

Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected

Event End Date:

Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected

Publisher

Name*:

University of Trento

URL:


Address*:

Trento, Italy

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

129-136

Year*:

1998

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We report on a software library of dynamic graph algorithms.
It was written in \CC as an extension of LEDA, the library
of efficient data types and algorithms. It contains implementations
of simple data structures as well as of sophisticated data
structures for dynamic connectivity, dynamic minimum spanning trees,
dynamic single source shortest paths, and dynamic transitive
closure. All data structures are implemented by classes derived
from a common base class, thus they have a common interface.
Additionally, the base class is in charge of keeping all dynamic
data structures working on the same graph consistent.
It is possible to change the structure of a graph by a procedure
which is not aware of the dynamic data structures initialized for
this graph. The library is easily extendible.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{Alberts-et-al-98,
AUTHOR = {Alberts, David and Cattaneo, G and Italiano, Giuseppe and Nanni, Umberto and Zaroliagis, Christos},
EDITOR = {Battiti, R and Bertosi, A},
TITLE = {A Software Library of Dynamic Graph Algorithms},
BOOKTITLE = {Proceedings of Workshop on Algorithms and Experiments (ALEX-98)},
PUBLISHER = {University of Trento},
YEAR = {1998},
PAGES = {129--136},
ADDRESS = {Trento, Italy},
}


Entry last modified by Christine Kiesel, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Christos Zaroliagis
Created
02/25/1999 06:55:54 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Evelyn Haak
Uwe Brahm
Christos Zaroliagis
Christos Zaroliagis
Edit Dates
20.09.2006 16:59:17
01/04/99 11:16:37
29.03.99 18:43:57
25/02/99 19:11:33
25/02/99 18:55:54
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section