On the NP-Completeness of Some Graph Cluster Measures
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F06%3A00339971" target="_blank" >RIV/67985807:_____/06:00339971 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the NP-Completeness of Some Graph Cluster Measures
Original language description
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Identifying clusters can be achieved by optimizing a fitness function that measures the quality of a cluster within the graph. Examples of suchcluster measures include the conductance, the local and relative densities, and single cluster editing. We prove that the decision problems associated with the optimization tasks of finding clusters that are optimal with respect to these fitness measures are NP-complete.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
SOFSEM 2006: Theory and Practice of Computer Science
ISBN
3-540-31198-X
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Měřín
Event date
Jan 21, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000235805500051