Spectral methods for graph bisection problems. (Q1406654): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4327459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127646 / 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: A computational study of graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for bisection width in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / 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: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing the Maximum Eigenvalue of a Symmetric Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Optimization of Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138918 / 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: Q3807887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank

Latest revision as of 09:38, 6 June 2024

scientific article
Language Label Description Also known as
English
Spectral methods for graph bisection problems.
scientific article

    Statements

    Spectral methods for graph bisection problems. (English)
    0 references
    0 references
    0 references
    7 September 2003
    0 references
    Eigenvalue
    0 references
    eigenvector
    0 references
    semidefinite programming
    0 references
    interior point method
    0 references
    subgradient method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references