Pardella, Gregor Leszek (2011). Efficient Polynomial-Time Algorithms for Special Graph Partitioning Problems. [Thesis Abstract]

[img]
Preview
PDF
abstract_gp.pdf

Download (35kB)
[img]
Preview
PDF
zusammenfassung_gp.pdf

Download (46kB)

Item Type: Thesis Abstract
Creators:
CreatorsEmailORCID
Pardella, Gregor Leszekpardella@informatik.uni-koeln.deUNSPECIFIED
URN: urn:nbn:de:hbz:38-42692
Publisher: Verlag Dr. Hut
ISBN: 978-3-8439-0020-1
Subjects: Data processing Computer science
Uncontrolled Keywords:
KeywordsLanguage
partitioning, max-cut, max-flow, min-cut, matching, VLSI chip design, VIA minimization, planar graphs, subgraph shrinking, efficient algorithmEnglish
Graphpartitionierung, Max-Cut, Max-Flow, Min-Cut, Matching, VLSI Chip Design, VIA Minimierung, Planare Graphen, Subgraphenschrumpfen, effiziente AlgorithmenGerman
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Institute of Computer Science
Language: English
Date: 2011
Date of oral exam: 20 June 2011
Referee:
NameAcademic Title
Liers, FraukePD Dr.
Jünger, MichaelProf. Dr.
Full Text Status: None
Date Deposited: 12 Aug 2011 12:40
Projects: COPhy
URI: http://kups.ub.uni-koeln.de/id/eprint/4269

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item