2069 search results - page 188 / 414 » Linear time algorithms for Clobber |
162
click to vote
GD
2005
Springer
16 years 8 hour ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
151
click to vote
APN
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
152
click to vote
VOSS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The paper presents a survey of out-of-core methods available for the analysis of large Markov chains on single workstations. First, we discuss the main sparse matrix stor...
169
click to vote
WG
2004
Springer
15 years 12 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
196
click to vote
ICANN
2001
Springer
15 years 11 months ago
2001
Springer
Empirical evidence indicates that the training time for the support vector machine (SVM) scales to the square of the number of training data points. In this paper, we introduce the...