Universität zu Köln
Login | Create Account
Deutsch

Efficient Polynomial-Time Algorithms for Special Graph Partitioning Problems

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

[img]
Preview
 PDF
Download (35Kb) | Preview
    [img]
    Preview
    		 PDF
    Download (45Kb) | Preview
      Item Type: Thesis Abstract
      Creators:
      CreatorsEmail
      Pardella, Gregor Leszekpardella@informatik.uni-koeln.de
      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: Mathematisch-Naturwissenschaftliche Fakultät
      Divisions: Mathematisch-Naturwissenschaftliche Fakultät > Institut für Informatik
      Date: 2011
      Date Type: Completion
      Date of oral exam: 20 June 2011
      Full Text Status: Public
      Date Deposited: 12 Aug 2011 14:40
      URI: http://kups.ub.uni-koeln.de/id/eprint/4269

      Actions (login required)

      		 View Item
      EPrints Logo
      Kölner UniversitätsPublikationsServer is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.