Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem - Archive ouverte HAL Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2010

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem

Abstract

An out-tree T is an oriented tree with only one vertex of in-degree zero. A vertex x of T is internal if its out-degree is positive. We design randomized and deterministic algorithms for deciding whether an input digraph contains a given out-tree with k vertices. The algorithms are of running time O*(5.704k) and O*(6.14k), respectively. We apply the deterministic algorithm to obtain a deterministic algorithm of runtime O*(ck), where c is a constant, for deciding whether an input digraph contains a spanning out-tree with at least k internal vertices. This answers in affirmative a question of Gutin, Razgon and Kim (Proc. AAIM'08) [9]
No file

Dates and versions

hal-00504734 , version 1 (21-07-2010)

Identifiers

  • HAL Id : hal-00504734 , version 1

Cite

Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, et al.. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. Journal of Computer and System Sciences, 2010, 76 (7), pp.650 - 662. ⟨hal-00504734⟩
236 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More