Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00263-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996134775 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Partition-distance: A problem and class of perfect graphs arising in clustering
scientific article

    Statements

    Partition-distance: A problem and class of perfect graphs arising in clustering (English)
    0 references
    0 references
    14 July 2002
    0 references
    partitioning
    0 references
    clustering
    0 references
    assignment problem
    0 references
    node cover
    0 references
    perfect graph
    0 references
    genetics
    0 references
    graph algorithms
    0 references
    combinatorial problems
    0 references

    Identifiers