Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Dorn, Frederic"'
We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied problems. For the first problem, {\sc $k$-Leaf Out-Branching}, which is
Externí odkaz:
http://arxiv.org/abs/1001.0821
Autor:
Dorn, Frederic
The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for subgraph isomorph
Externí odkaz:
http://arxiv.org/abs/0909.4692
Autor:
Bonsma, Paul, Dorn, Frederic
An out-tree $T$ of a directed graph $D$ is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By $l(D)$ and $l_s(D)$ we denote the maximum number of leaves over all out-trees and out-branchi
Externí odkaz:
http://arxiv.org/abs/0804.2032
Autor:
Bonsma, Paul, Dorn, Frederic
An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D has an out-branching with at least k leaves (Directed Spanning k-Leaf).
Externí odkaz:
http://arxiv.org/abs/0711.4052
Publikováno v:
In Energy Procedia January 2016 87:69-76
Publikováno v:
In Information and Computation December 2013 233:60-70
Publikováno v:
In Journal of Computer and System Sciences September 2012 78(5):1606-1622
Publikováno v:
In Theoretical Computer Science 2011 412(50):7018-7028
Autor:
Dorn, Frederic, Telle, Jan Arne
Publikováno v:
In Discrete Applied Mathematics 2009 157(12):2737-2746