Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
- 25 January 2010
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 76 (7) , 650-662
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Finding paths of length k in timeInformation Processing Letters, 2009
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing AlgorithmsSIAM Journal on Computing, 2009
- Color-codingJournal of the ACM, 1995
- Perfect Hashing and ProbabilityCombinatorics, Probability and Computing, 1994
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Constant Time Generation of Rooted TreesSIAM Journal on Computing, 1980
- The Number of TreesAnnals of Mathematics, 1948