Strong SDP based bounds on the cutwidth of a graph (Q6065655): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on exact algorithms for vertex ordering problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for the Quadratic Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with small bandwidth and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hyperbolicity of bipartite graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning through projections: strong SDP bounds for large graph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental comparison of four graph drawing algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exact approaches to row layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle approach for SDPs with exact subgraph constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SDP-based approach for computing the stability number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth of Split Graphs and Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space of closed subgroups of ℝ<sup><i>n</i></sup>is stratified and simply connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the matrix bandwidth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound for the cutwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth and cyclic antibandwidth of meshes and hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth of the de Bruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the bandwidth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Latest revision as of 13:49, 3 August 2024

scientific article; zbMATH DE number 7765557
Language Label Description Also known as
English
Strong SDP based bounds on the cutwidth of a graph
scientific article; zbMATH DE number 7765557

    Statements

    Strong SDP based bounds on the cutwidth of a graph (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2023
    0 references
    cutwidth
    0 references
    linear ordering
    0 references
    semidefinite programming
    0 references
    combinatorial optimization
    0 references
    0 references

    Identifiers