2487 search results - page 79 / 498 » Partitions of Graphs into Trees |
DASFAA
2004
IEEE
14 years 1 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
COLOGNETWENTE
2009
13 years 10 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
IS
2011
13 years 4 months ago
2011
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...