830 search results - page 76 / 166 » Route kernels for trees |
144
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
157
click to vote
SAINT
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we present Hierarchy-Based Anycast Routing (HAR), a routing protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims t...
161
Voted
TON
2012
13 years 6 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
145
Voted
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...
148
Voted
GLVLSI
2000
IEEE
15 years 8 months ago
2000
IEEE
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...