\(k\)-distinct in- and out-branchings in digraphs (Q1747490): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Spanning Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint in- and out-branchings in tournaments and related path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for non-separating trees and branchings in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-disjoint paths and trees in 2-regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small degree out‐branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning strong subdigraph problem is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament pathwidth and topological containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for finding trees with many leaves / rank
 
Normal rank

Revision as of 14:18, 15 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-distinct in- and out-branchings in digraphs
scientific article

    Statements

    \(k\)-distinct in- and out-branchings in digraphs (English)
    0 references
    0 references
    0 references
    0 references
    8 May 2018
    0 references
    branching
    0 references
    leaf
    0 references
    decomposition
    0 references
    fixed-parameter tractable
    0 references

    Identifiers