Three NP-Complete Optimization Problems in Seidel's Switching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00206094" target="_blank" >RIV/00216208:11320/08:00206094 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Three NP-Complete Optimization Problems in Seidel's Switching
Original language description
Annotation in the original language is: In this paper, we show the NP-completeness of the problem to determine if a given graph is switching-equivalent to a graph containing a clique whose size is at least a constant fraction of the graph size. We also prove the NP-completeness of deciding if a given graph is switching-equivalent to a graph having at least a given number of edges.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
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
Proceedings of the International Workshop on Combinatorial Algorithms 2007
ISBN
9781904987673
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
—
Publisher name
College Publications
Place of publication
United Kingdom
Event location
United Kingdom
Event date
Jan 1, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—