Parameterized algorithms for module map problems (Q5918889): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.dam.2020.01.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3021760796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going weighted: parameterized algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for cluster editing: Evaluation and experiments / 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: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Destroying bicolored \(P_3\)s by deleting few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing edge modification problems above lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 23:44, 22 July 2024

scientific article; zbMATH DE number 7215490
Language Label Description Also known as
English
Parameterized algorithms for module map problems
scientific article; zbMATH DE number 7215490

    Statements

    Parameterized algorithms for module map problems (English)
    0 references
    0 references
    0 references
    29 June 2020
    0 references
    graph modification problem
    0 references
    multilayer graphs
    0 references
    search tree algorithm
    0 references
    kernelization
    0 references
    graph classes
    0 references

    Identifiers