On the relation of strong triadic closure and cluster deletion (Q5915591): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127365021, #quickstatements; #temporary_batch_1722288576454
 
(4 intermediate revisions by 3 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6983010
scientific article; zbMATH DE number 7175607
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1435.68235 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/s00453-019-00617-1 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithmica / rank
 
Normal rank
Property / publication date
 
28 February 2020
Timestamp+2020-02-28T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 28 February 2020 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7175607 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952751130 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1803.00807 / rank
 
Normal rank
Property / zbMATH Keywords
 
social networks
Property / zbMATH Keywords: social networks / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter algorithms
Property / zbMATH Keywords: fixed-parameter algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
kernelization
Property / zbMATH Keywords: kernelization / rank
 
Normal rank
Property / zbMATH Keywords
 
graph classes
Property / zbMATH Keywords: graph classes / 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: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Your rugby mates don't need to know your colleagues: triadic closure with edge colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cluster deletion problem for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation of strong triadic closure and cluster deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / 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: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for maximum-profit facility location under matroid constraints / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127365021 / rank
 
Normal rank

Latest revision as of 22:55, 29 July 2024

scientific article; zbMATH DE number 7175607
Language Label Description Also known as
English
On the relation of strong triadic closure and cluster deletion
scientific article; zbMATH DE number 7175607

    Statements

    On the relation of strong triadic closure and cluster deletion (English)
    0 references
    0 references
    0 references
    22 November 2018
    0 references
    28 February 2020
    0 references
    social networks
    0 references
    fixed-parameter algorithms
    0 references
    kernelization
    0 references
    graph classes
    0 references

    Identifiers

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