2294 search results - page 186 / 459 » From Path Graphs to Directed Path Graphs |
138
Voted
TOC
2008
15 years 2 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
149
click to vote
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
112
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
170
click to vote
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
146
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...