2487 search results - page 464 / 498 » Partitions of Graphs into Trees |
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
ICCBR
2003
Springer
14 years 1 months ago
2003
Springer
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
WEBDB
2010
Springer
14 years 1 months ago
2010
Springer
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
ICDCS
2002
IEEE
14 years 29 days ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
SIGMOD
2010
ACM
14 years 25 days ago
2010
ACM
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...