Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/jcss/CohenFGKSY10, #quickstatements; #temporary_batch_1731483406851
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Generation of Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972950 / 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: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Leaf Out-Branching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hashing and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / 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: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/CohenFGKSY10 / rank
 
Normal rank

Latest revision as of 08:48, 13 November 2024

scientific article
Language Label Description Also known as
English
Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
scientific article

    Statements

    Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (English)
    0 references
    0 references
    18 August 2010
    0 references
    out-tree
    0 references
    out-branching
    0 references
    internal vertices
    0 references
    divide-and-conquer
    0 references

    Identifiers