Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.endm.2009.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971373505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Directed Maximum Leaf Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms and Bounds for Directed Maximum Leaf Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems without Polynomial Kernels (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / 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: On complexity of minimum leaf out-branching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the maximum leaf spanning arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for problems with no kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of some Maximum Spanning Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Leaf Out-Branching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Finding Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbres avec un nombre maximum de sommets pendants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:15, 6 July 2024

scientific article
Language Label Description Also known as
English
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
scientific article

    Statements

    Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (English)
    0 references
    0 references
    4 July 2013
    0 references
    0 references
    out-trees
    0 references
    out-branchings
    0 references
    leaves
    0 references
    internal vertices
    0 references
    FPT
    0 references
    kernel
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references