1538 search results - page 92 / 308 » Spectral Techniques in Graph Algorithms |
116
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
110
click to vote
GEM
2007
15 years 2 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
151
click to vote
CONSTRAINTS
1998
15 years 1 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
132
click to vote
IFM
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
108
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...