FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2009.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138156539 / rank
 
Normal rank

Revision as of 00:21, 20 March 2024

scientific article
Language Label Description Also known as
English
FPT algorithms and kernels for the directed \(k\)-leaf problem
scientific article

    Statements

    FPT algorithms and kernels for the directed \(k\)-leaf problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 February 2010
    0 references
    out-branching subgraph
    0 references
    digraph
    0 references
    leaves
    0 references
    fixed-parameter tractable
    0 references
    kernel
    0 references
    directed max leaf problem
    0 references
    rooted directed k-leaf problem
    0 references

    Identifiers