Staff View
New algorithmic and hardness results for graph partitioning problems

Descriptive

TitleInfo
Title
New algorithmic and hardness results for graph partitioning problems
Name (type = personal)
NamePart (type = family)
Kaminski
NamePart (type = given)
Marcin Jakub
DisplayForm
Marcin Kaminski
Role
RoleTerm (authority = RUETD)
author
Name (type = personal)
NamePart (type = family)
Lozin
NamePart (type = given)
Vadim
Affiliation
Advisory Committee
DisplayForm
Vadim Lozin
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Saks
NamePart (type = given)
Michael
Affiliation
Advisory Committee
DisplayForm
Michael Saks
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Gurvich
NamePart (type = given)
Vladimir
Affiliation
Advisory Committee
DisplayForm
Vladimir Gurvich
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Boros
NamePart (type = given)
Endre
Affiliation
Advisory Committee
DisplayForm
Endre Boros
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Thilikos
NamePart (type = given)
Dimitrios
Affiliation
Advisory Committee
DisplayForm
Dimitrios Thilikos
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
Graduate School-New Brunswick
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2007
DateOther (qualifier = exact); (type = degree)
2007
Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
PhysicalDescription
Form (authority = marcform)
electronic
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
iv, 63 pages
Abstract (type = abstract)
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and maximum cut. This is a summary of main results of the thesis:
* A polynomial-time algorithm for k-VERTEX-COLORABILITY in the class of
P5-free graphs (for any fixed value k).
* A proof of NP-completeness of VERTEX- and EDGES_COLORABILITY in the class of graphs with girth at least g for any value of g ≥ 3.
* A polynomial-time algorithm for 3-VERTEX-COLORABILITY of (claw,hourglass)-free graphs and an extension of that result to an infinitely increasing family of subclasses of claw-free graphs.
* An exact algorithm for MAX-CUT running in time O*(2(1-2/Delta)n) in the class of graphs with maximum degree Delta.
* A proof of NP-completeness of MAX-CUT and MAX-BISECTION on unit disk graphs.
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references (p. 57-61).
Subject (authority = RUETD)
Topic
Operations Research
Subject (authority = ETD-LCSH)
Topic
Graph algorithms
Subject (authority = ETD-LCSH)
Topic
Graph coloring
Subject (authority = ETD-LCSH)
Topic
Graph theory
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472
Identifier
ETD_175
Identifier (type = doi)
doi:10.7282/T3J67HDC
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (AUTHORITY = GS); (ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
AssociatedEntity (AUTHORITY = rulib); (ID = 1)
Name
Marcin Kaminski
Role
Copyright holder
Affiliation
Rutgers University. Graduate School-New Brunswick
RightsEvent (AUTHORITY = rulib); (ID = 1)
Type
Permission or license
Detail
Non-exclusive ETD license
AssociatedObject (AUTHORITY = rulib); (ID = 1)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top

Technical

Format (TYPE = mime); (VERSION = )
application/x-tar
FileSize (UNIT = bytes)
415232
Checksum (METHOD = SHA1)
2320dd876d29d5b45db36ce8f6f289550b3faf5b
ContentModel
ETD
CompressionScheme
other
OperatingSystem (VERSION = 5.1)
windows xp
Format (TYPE = mime); (VERSION = NULL)
application/x-tar
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024