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]
Type de document :
Article dans une revue
Journal of Computer and System Sciences, Elsevier, 2010, 76 (7), pp.650 - 662
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00504734
Contributeur : Nathann Cohen <>
Soumis le : mercredi 21 juillet 2010 - 12:08:43
Dernière modification le : mercredi 2 mars 2011 - 11:16:23

Identifiants

  • HAL Id : hal-00504734, version 1

Collections

Citation

Nathann Cohen, Fedor 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, Elsevier, 2010, 76 (7), pp.650 - 662. <hal-00504734>

Partager

Métriques

Consultations de la notice

249