On the directed full degree spanning tree problem (Q456701): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2010.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072755080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4761320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Search and Placement of Meters in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem / 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: A Linear Vertex Kernel for Maximum Internal Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Leaf Out-Branching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank

Latest revision as of 19:13, 5 July 2024

scientific article
Language Label Description Also known as
English
On the directed full degree spanning tree problem
scientific article

    Statements

    On the directed full degree spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    full degree spanning tree
    0 references
    0 references