On semidefinite programming bounds for graph bandwidth (Q5299908): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal labelling of a product of two paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bandwidth Approximation for Trees and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral approach to bandwidth and separator problems in graphs / 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: Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of Combinatorial Problems Via Association Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs with equal bandwidth and cyclic bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Copositive Programming Approach to Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of the complete \(k\)-ary tree / 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: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 13:15, 6 July 2024

scientific article; zbMATH DE number 6179990
Language Label Description Also known as
English
On semidefinite programming bounds for graph bandwidth
scientific article; zbMATH DE number 6179990

    Statements

    On semidefinite programming bounds for graph bandwidth (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    graph bandwidth
    0 references
    cyclic bandwidth
    0 references
    semidefinite programming
    0 references
    quadratic assignment problem
    0 references
    0 references
    0 references

    Identifiers