General variable neighborhood search for computing graph separators (Q1677293): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-014-0793-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028260818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for solving the vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for minimum-weight vertex separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: algorithms and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank

Latest revision as of 17:46, 14 July 2024

scientific article
Language Label Description Also known as
English
General variable neighborhood search for computing graph separators
scientific article

    Statements

    General variable neighborhood search for computing graph separators (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2017
    0 references
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    VNS
    0 references
    graph separators
    0 references
    0 references