English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Graph Iterators: Decoupling Graph Structures from Algorithms

Nissen, M. (1998). Graph Iterators: Decoupling Graph Structures from Algorithms. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Files

show Files

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: I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software is an important and difficult problem in general, and this is particularly true for graph algorithms. The scientific literature demonstrates plenty of applications of graph algorithms as subroutines for other algorithms. Moreover, many practical problems from various domains may be modeled as graph problems and hence solved by means of graph algorithms. Chapter 2 introduces some data structures that will be used in 5 basic graph algorithms in chapter 3. Chapter 4 discusses an implementation of a maximum cardinality matching algorithm for general graphs. Chapter 5 explains some techniques in C++, which are useful to implement the data structures and algorithms in an efficient way. Finally chapter 6 contains some concluding remarks.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-0219981998
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517943
Other: Local-ID: C1256428004B93B8-54F6CB97B20CE1F3C12566B90044F377-Nissen98
 Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show