Universität zu Köln

Pardella, Gregor Leszek (2011). Efficient Polynomial-Time Algorithms for Special Graph Partitioning Problems. Thesis Abstract, Universität zu Köln.

Preview	PDF abstract_gp.pdf Download (35kB)
Preview	PDF zusammenfassung_gp.pdf Download (46kB)

Item Type:	Thesis Abstract
Creators:	Creators Email ORCID ORCID Put Code Pardella, Gregor Leszek pardella@informatik.uni-koeln.de UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-42692
Date:	2011
Publisher:	Verlag Dr. Hut
ISBN:	978-3-8439-0020-1
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Uncontrolled Keywords:	Keywords Language partitioning, max-cut, max-flow, min-cut, matching, VLSI chip design, VIA minimization, planar graphs, subgraph shrinking, efficient algorithm English Graphpartitionierung, Max-Cut, Max-Flow, Min-Cut, Matching, VLSI Chip Design, VIA Minimierung, Planare Graphen, Subgraphenschrumpfen, effiziente Algorithmen German
Date of oral exam:	20 June 2011
Referee:	Name Academic Title Liers, Frauke PD Dr. Jünger, Michael Prof. Dr.
Projects:	COPhy
Refereed:	Yes
URI:	http://kups.ub.uni-koeln.de/id/eprint/4269