Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
type: Item
instance of: scholarly article
title: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
zbMATH Open document ID: 1210.05022
author: J. Martínez
published in: Journal of Computer and System Sciences
publication date: 2010-08-18T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 5772417
zbMATH Keywords: out-tree
zbMATH Keywords: out-branching
zbMATH Keywords: internal vertices
zbMATH Keywords: divide-and-conquer
Wikidata QID: Q60488594
MaRDI profile type: Publication
full work available at URL: j.jcss.2010.01.001
OpenAlex ID: W1980860702
cites work: Color-coding
cites work: Constant Time Generation of Rooted Trees
cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
cites work: Q3972950
cites work: Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: Minimum Leaf Out-Branching Problems
cites work: Faster Algebraic Algorithms for Path and Packing Problems
cites work: Q4231923
cites work: Perfect Hashing and Probability
cites work: The number of trees
cites work: Algorithms and Data Structures
cites work: Q3369936
cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time
DBLP publication ID: journals/jcss/CohenFGKSY10
DOI: 10.1016/J.JCSS.2010.01.001
description: scientific article; zbMATH DE number 5772417