Covering directed graphs by in-trees

Naoyuki Kamiyama () and Naoki Katoh ()
Additional contact information
Naoyuki Kamiyama: Chuo University
Naoki Katoh: Kyoto University

Journal of Combinatorial Optimization, 2011, vol. 21, issue 1, No 2, 2-18

Abstract: Abstract Given a directed graph D=(V,A) with a set of d specified vertices S={s 1,…,s d }⊆V and a function f : S→ℕ where ℕ denotes the set of positive integers, we consider the problem which asks whether there exist ∑ i=1 d f(s i ) in-trees denoted by $T_{i,1},T_{i,2},\ldots,T_{i,f(s_{i})}$ for every i=1,…,d such that $T_{i,1},\ldots,T_{i,f(s_{i})}$ are rooted at s i , each T i,j spans vertices from which s i is reachable and the union of all arc sets of T i,j for i=1,…,d and j=1,…,f(s i ) covers A. In this paper, we prove that such set of in-trees covering A can be found by using an algorithm for the weighted matroid intersection problem in time bounded by a polynomial in ∑ i=1 d f(s i ) and the size of D. Furthermore, for the case where D is acyclic, we present another characterization of the existence of in-trees covering A, and then we prove that in-trees covering A can be computed more efficiently than the general case by finding maximum matchings in a series of bipartite graphs.

Keywords: Directed graph; In-tree; Covering; Weighted matroid intersection (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9242-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:21:y:2011:i:1:d:10.1007_s10878-009-9242-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9242-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().