9532 search results - page 282 / 1907 » Logic, Graphs, and Algorithms |
142
click to vote
CIAC
2010
Springer
16 years 4 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
198
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
178
Voted
COLT
2005
Springer
16 years 5 days ago
2005
Springer
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
163
click to vote
TALG
2008
15 years 6 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
154
click to vote
DLOG
2008
15 years 9 months ago
2008
Abstract. We propose an approach for extending a tableau-based satisfiability algorithm by an arithmetic component. The result is a hybrid satisfiability algorithm for the Descript...