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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Component order connectivity in directed graphs
Property / full work available at URL
 
Property / full work available at URL: https://arxiv.org/pdf/2007.06896 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3116996386 / rank
 
Normal rank
Property / title
 
Component order connectivity in directed graphs (English)
Property / title: Component order connectivity in directed graphs (English) / 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: 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: Graph-theoretic concepts in computer science. 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989. Proceedings / rank
 
Normal rank

Latest revision as of 13:58, 3 August 2024

scientific article; zbMATH DE number 7764093
Language Label Description Also known as
English
Component order connectivity in directed graphs
scientific article; zbMATH DE number 7764093

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized algorithms
    0 references
    component order connectivity
    0 references
    directed graphs
    0 references
    semicomplete digraphs
    0 references
    0 references
    Component order connectivity in directed graphs (English)
    0 references