Graph Iterators: Decoupling Graph Structures from Algorithms

Nissen, Marco

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 公開

表示: 全項目非表示: 全項目

基本情報

表示: 非表示:

アイテムのパーマリンク: https://hdl.handle.net/11858/00-001M-0000-000F-37A1-5 版のパーマリンク: https://hdl.handle.net/11858/00-001M-0000-0024-A75D-3

資料種別: 学位論文

ファイル

表示: ファイル

作成者

表示:

非表示:

作成者:
Nissen, Marco¹, 著者

所属:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

内容説明

表示:

非表示:

キーワード: -

要旨: 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.

資料詳細

表示:

非表示:

言語: eng - English

日付: 修正: 2010-03-02受理: 1998出版: 1998

出版の状態: 出版

ページ: -

出版情報: Saarbrücken : Universität des Saarlandes

目次: -

査読: -

識別子（DOI, ISBNなど）: eDoc: 517943
その他: Local-ID: C1256428004B93B8-54F6CB97B20CE1F3C12566B90044F377-Nissen98

学位: 修士号 (Master)

アイテム詳細

基本情報

ファイル

関連URL

作成者

内容説明

資料詳細

関連イベント

訴訟

Project information

出版物