Path optimization for graph partitioning problems (Q1276954): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for graph partition problems / 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: .879-approximation algorithms for MAX CUT and MAX 2SAT / 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: Q3347934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / 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: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node and edge relaxations of the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection technique for partitioning the nodes of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank

Latest revision as of 17:15, 28 May 2024

scientific article
Language Label Description Also known as
English
Path optimization for graph partitioning problems
scientific article

    Statements

    Path optimization for graph partitioning problems (English)
    0 references
    0 references
    0 references
    2 February 1999
    0 references
    path optimization
    0 references
    graph partitioning
    0 references

    Identifiers