An approximation algorithm for the maximum leaf spanning arborescence problem (Q2930326): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56502745, #quickstatements; #temporary_batch_1705917335470
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 21:14, 3 February 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the maximum leaf spanning arborescence problem
scientific article

    Statements

    An approximation algorithm for the maximum leaf spanning arborescence problem (English)
    0 references
    0 references
    0 references
    18 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    arborescence
    0 references
    directed graphs
    0 references
    maximum leaf
    0 references
    0 references