Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q831860
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W846902610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster parameterized cluster deletion and cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering in general weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cluster deletion problem for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Clique Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing problem for points on the real line: a polynomial time algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank

Latest revision as of 18:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Complexity of the cluster deletion problem on subclasses of chordal graphs
scientific article

    Statements

    Complexity of the cluster deletion problem on subclasses of chordal graphs (English)
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    block graphs
    0 references
    cliques
    0 references
    edge deletion
    0 references
    cluster deletion
    0 references
    interval graphs
    0 references
    split graphs
    0 references
    submodular functions
    0 references
    chordal graphs
    0 references
    cographs
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references