Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
On NP−hardness of the clique p...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
On NP−hardness of the clique partition – Independence number gap recognition and related problems
Bibliographic Details
Main Authors:
Busygin, S
,
Pasechnik, D
Format:
Journal article
Published:
2006
Holdings
Description
Similar Items
Staff View
Similar Items
On NP-hardness of the clique partition : independence number gap recognition and related problems
by: Busygin, Stanislav., et al.
Published: (2012)
GPSG-Recognition is NP-Hard
by: Ristad, Eric Sven
Published: (2004)
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
by: Valentin E. Brimkov, et al.
Published: (2024-01-01)
Approximation algorithms for NP-hard problems /
by: Hochbaum, Dorit (Dorit S.)
Published: (1997)
NP-hardness of deciding convexity of quartic polynomials and related problems
by: Ahmadi, Amir Ali, et al.
Published: (2012)