Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection (Q1810886): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1021390231133 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1498543354 / rank
 
Normal rank

Latest revision as of 09:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
scientific article

    Statements

    Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection (English)
    0 references
    0 references
    0 references
    9 June 2003
    0 references
    Min-bisection
    0 references
    Dense-\(k\)-subgraph
    0 references
    Polynomial approximation algorithm
    0 references
    Semidefinite programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references