The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Juan Carlos Vera / rank
Normal rank
 
Property / author
 
Property / author: Juan Carlos Vera / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162383213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number of products of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new table of constant weight codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number, colorings, and codes of the Johnson graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the bipartite induced subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving VLSI design and DNA sequencing problems using bipartization of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Operator $\Psi$ for the Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spectrum sharing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algorithms for the partial directed weighted improper coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for the maximum \(k\)-colorable subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum \(k\)-colorable subgraph problem and orbitopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for partitioning, assignment and ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MIN-cut and vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Given Group and Given Graph-Theoretical Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP Relaxations for Some Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming and eigenvalue bounds for the graph partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Latest revision as of 12:14, 29 July 2024

scientific article; zbMATH DE number 7549399
Language Label Description Also known as
English
The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems
scientific article; zbMATH DE number 7549399

    Statements

    The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    0 references
    \(k\)-colorable subgraph problem
    0 references
    stable set
    0 references
    chromatic number of a graph
    0 references
    generalized theta number
    0 references
    semidefinite programming
    0 references
    Johnson graphs
    0 references
    Hamming graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references