On NP−hardness of the clique partition – Independence number gap recognition and related problems

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

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)

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
by: Belyi, Alexander, et al.
Published: (2023)

NP-hardness of deciding convexity of quartic polynomials and related problems
by: Ahmadi, Amir Ali, et al.
Published: (2012)

on the number of cliques and cycles in graphs
by: Mojgan Emami, et al.
Published: (2013-06-01)

On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
by: Charles A. Phillips, et al.
Published: (2019-01-01)

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
by: Chuan-Min Lee
Published: (2021-01-01)

An overview on polynomial approximation of NP-hard problems
by: Paschos Vangelis Th.
Published: (2009-01-01)

NP-Hardness of the Problem of Optimal Box Positioning
by: Alexei V. Galatenko, et al.
Published: (2019-08-01)

Ramsey numbers of cubes versus cliques
by: Conlon, David, et al.
Published: (2015)

Many bounded versions of undecidable problems are NP-hard
by: Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma de las Cuevas
Published: (2023-06-01)

Heuristics for NP-hard optimization problems - simpler is better!?
by: Žerovnik Janez
Published: (2015-11-01)

NP-hardness of some linear control design problems
Published: (2003)

Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020)

Independent sets in graphs with an excluded clique minor
by: David R. Wood
Published: (2007-01-01)

Independent Sets in Graphs with an Excluded Clique Minor
by: David R. Wood
Published: (2007-01-01)

On graphs with equal coprime index and clique number
by: Chetan Patil, et al.
Published: (2023-09-01)

Number of Cliques in Graphs with a Forbidden Subdivision
by: Lee, Choongbum, et al.
Published: (2016)

The clique number and some Hamiltonian properties of graphs
by: Rao Li
Published: (2021-08-01)

NP-hardness of minimum circuit size problem for OR-AND-MOD circuits
by: Hirahara, S, et al.
Published: (2018)

NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
by: Rhonda Au-Yeung, et al.
Published: (2023-02-01)

Empirical analysis and optimization of an NP−hard problem using CSP and FDR
by: Creager, D, et al.
Published: (2007)

Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs
by: Wellens, Jake(Jake Lee)
Published: (2020)

The Clique Number and The Chromatics Number Of The Coprime Graph for The Generalized Quarternion Group
by: Marena Rahayu Gayatri, et al.
Published: (2023-04-01)

Graphs with Strong Proper Connection Numbers and Large Cliques
by: Yingbin Ma, et al.
Published: (2023-04-01)

A Note on the Signed Clique Domination Numbers of Graphs
by: Baogen Xu, et al.
Published: (2022-01-01)

Distance signless Laplacian eigenvalues, diameter, and clique number
by: Saleem Khan, et al.
Published: (2022-04-01)

Chromatic and clique numbers of a class of perfect graphs
by: Mohammad Reza Fander
Published: (2015-12-01)

On the problem of finding approximation of bipatite cliques
by: Nikolay N. Kuzyurin
Published: (2018-10-01)

The cellular selection mechanism for multi solution NP-hard optimization problems /
by: Hossein Rajabalipour Cheshmehgaz, 1975-, author, et al.
Published: (2009)

Identification and signatures based on NP-hard problems of indefinite quadratic forms
by: Hartung Rupert J., et al.
Published: (2008-12-01)

Probabilistic solving of NP-hard problems with bistable nonlinear optical networks
by: Kyriienko, O., et al.
Published: (2019)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
by: Dalirrooyfard, Mina, et al.
Published: (2024)

The independence and clique polynomials of the center graphs of some finite groups
by: Najmuddin, Nabilah, et al.
Published: (2020)

Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number
by: A. N. Maksimenko
Published: (2014-10-01)

Lower bounds on the signed (total) $k$-domination number depending on the clique number
by: L‎. ‎Volkmann
Published: (2018-01-01)

Auxiliary-Function-Based Independent Vector Analysis Using Generalized Inter-Clique Dependence Source Models With Clique Variance Estimation
by: Ui-Hyeop Shin, et al.
Published: (2020-01-01)

On basing private information retrieval on NP-hardness
by: Liu, Tianren, Ph. D. Massachusetts Institute of Technology
Published: (2016)