1736 search results - page 64 / 348 » The rank-width of Directed Graphs |
171
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
136
click to vote
GBRPR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
127
Voted
APVIS
2004
15 years 5 months ago
2004
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
137
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
145
click to vote
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...