English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Integration of graph iterators into LEDA

Nissen, M.(1999). Integration of graph iterators into LEDA (MPI-I-1999-1-006). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

Files

show Files
hide Files
:
1999-1-006 (Any fulltext), 10KB
Name:
1999-1-006
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
text/html / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Nissen, Marco1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: This paper explains some implementation details of graph iterators and data accessors in LEDA. It shows how to create new iterators for new graph implementations such that old algorithms can be re--used with new graph implementations as long as they are based on graph iterators and data accessors.

Details

show
hide
Language(s): eng - English
 Dates: 1999
 Publication Status: Issued
 Pages: 39 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: URI: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1999-1-006
Report Nr.: MPI-I-1999-1-006
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -