1736 search results - page 13 / 348 » The rank-width of Directed Graphs |
74
Voted
IMCSIT
2010
14 years 8 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
104
click to vote
PVLDB
2008
14 years 8 months ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
STACS
2010
Springer
15 years 5 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
ICML
2007
IEEE
15 years 11 months ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...