127 search results - page 3 / 26 » Some Parameterized Problems On Digraphs |
CPM
2010
Springer
13 years 9 months ago
2010
Springer
CPM
2008
Springer
13 years 6 months ago
2008
Springer
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
DAM
2006
13 years 5 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
ENDM
2010
13 years 2 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...