15254 search results - page 8 / 3051 » A k |
JCSS
2010
13 years 5 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
WDAG
2005
Springer
14 years 25 days ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
CACM
1999
13 years 7 months ago
1999
ECAI
2004
Springer
14 years 22 days ago
2004
Springer
A Bayesian network is an appropriate tool to deal with the uncertainty that is typical of real-life applications. Bayesian network arcs represent statistical dependence between dif...
SWAT
1990
Springer
13 years 11 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...