Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preventing Unraveling in Social Networks: The Anchored k-Core Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing small partial coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication and Coordination in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 15:21, 11 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of the anchored \(k\)-core problem for directed graphs
scientific article

    Statements

    Parameterized complexity of the anchored \(k\)-core problem for directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2016
    0 references
    0 references
    parameterized complexity
    0 references
    directed graphs
    0 references
    anchored \(k\)-core
    0 references
    0 references
    0 references
    0 references