New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q162970
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: van Dam, Edwin R. / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1841503951 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.06595 / 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: Bipartite Subgraphs and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the \(k\)-partition polytope / 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: Exploiting special structure in semidefinite programming: a survey of theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of maximum \(k\)-section / 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: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Web Facets for Multicut Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / 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: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility conditions for the existence of walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programs and association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially Complete Fault Detection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realignment in the National Football League: Did they do it right? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on max-cut problem with an application to digital-analogue convertors / 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: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / 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: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / 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: An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem / rank
 
Normal rank

Latest revision as of 04:37, 11 July 2024

scientific article
Language Label Description Also known as
English
New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
scientific article

    Statements

    New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (English)
    0 references
    0 references
    0 references
    14 December 2015
    0 references
    \(\max\)-\(k\)-cut
    0 references
    chromatic number
    0 references
    semidefinite programming
    0 references
    Laplacian eigenvalues
    0 references
    walk-regular graphs
    0 references
    association schemes
    0 references
    strongly regular 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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references