Component order connectivity in directed graphs (Q2165039): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q558237
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3042980074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Cover-Free Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the directed feedback vertex set problem / 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 the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for generalizations of directed feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4634403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into small pieces with applications to path transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5089249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694754 / rank
 
Normal rank

Latest revision as of 21:37, 29 July 2024

scientific article
Language Label Description Also known as
English
Component order connectivity in directed graphs
scientific article

    Statements

    Component order connectivity in directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2022
    0 references
    directed graph
    0 references
    order connectivity
    0 references
    strong connectivity
    0 references
    parameterized complexity
    0 references

    Identifiers