Cluster graph modification problems (Q1885821): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Phylogenetic Roots with Bounded Degrees and Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414513 / rank
 
Normal rank

Latest revision as of 14:12, 7 June 2024

scientific article
Language Label Description Also known as
English
Cluster graph modification problems
scientific article

    Statements

    Cluster graph modification problems (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2004
    0 references
    Clustering
    0 references
    Cluster graph
    0 references
    Graph modification problem
    0 references
    Complexity
    0 references
    Approximation
    0 references

    Identifiers