A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Glauber dynamics on trees and hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge-isoperimetric problem for powers of the Petersen graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the equicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers and Cutwidths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3661483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dynamics of the glass transition on Bethe lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR LAYOUT OF GENERALIZED HYPERCUBES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated tabu search for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / 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 02:04, 6 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for the minimum cut linear arrangement problem
scientific article

    Statements

    A branch-and-bound algorithm for the minimum cut linear arrangement problem (English)
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    graph
    0 references
    cutwidth
    0 references
    minimum cut linear arrangement
    0 references
    branch-and-bound algorithm
    0 references
    tabu search
    0 references
    0 references