458 search results - page 51 / 92 » Totally magic graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
IS
2008
13 years 7 months ago
2008
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
JMLR
2008
13 years 7 months ago
2008
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
TCS
2008
13 years 7 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
MICS
2010
13 years 6 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...