Staff View
Clustering and Domination in Perfect Graphs

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
21 p.
Note (type = special display note)
Technical report DCS-TR-135
Name (type = corporate); (authority = RutgersOrg-School)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (type = corporate); (authority = RutgersOrg-Department)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Clustering and Domination in Perfect Graphs
Abstract (type = abstract)
A K-Cluster in a graph is an induced sub graph on k-vertices, which maximizes the number of edges. Both the K-Cluster problem and the K-dominating set problem are NP-complete for graphs in general. In this paper we investigate the complexity status of these problems on various subclasses of perfect graphs. In particular, we examine comparability graphs, chordal graphs, bipartite graphs, split graphs, co graphs and K-trees. For example, it is shown that the K-Cluster problem is NP-complete for both bipartite and chordal graphs and the independent K-dominating set problem is NP-complete for bipartite graphs. Furthermore, where the Kcluster problem is polynomial we study the weighted and connected versions as well. Similarly we also look at the minimum K-dominating set problem on families, which have polynomial K-dominating set algorithms.
Name (type = personal)
NamePart (type = family)
Corneil
NamePart (type = given)
D. G.
Affiliation
University of Toronto
Role
RoleTerm (type = text); (authority = marcrt)
author
Name (type = personal)
NamePart (type = family)
Perl
NamePart (type = given)
Yehoshua
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (type = text); (authority = marcrt)
author
OriginInfo
DateCreated (encoding = w3cdtf); (qualifier = exact); (keyDate = yes)
1983-10
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3XP78F5
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
Back to the top
Version 8.3.10
Rutgers University Libraries - Copyright ©2019