Strong triadic closure in cographs and graphs of low maximum degree (Q5915633): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.05.012 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2803851338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the cluster deletion problem on subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for finding square roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cluster deletion problem for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independence Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong triadic closure in cographs and graphs of low maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5136273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai graphs and anti-Gallai graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.05.012 / rank
 
Normal rank

Latest revision as of 23:58, 10 December 2024

scientific article; zbMATH DE number 6882317
Language Label Description Also known as
English
Strong triadic closure in cographs and graphs of low maximum degree
scientific article; zbMATH DE number 6882317

    Statements

    Strong triadic closure in cographs and graphs of low maximum degree (English)
    0 references
    8 June 2018
    0 references
    strong triadic closure
    0 references
    cluster deletion
    0 references
    cographs
    0 references
    bounded degree graphs
    0 references
    NP-completeness
    0 references
    polynomial-time algorithm
    0 references

    Identifiers

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