Sciweavers

3708 search results - page 584 / 742
» Approximating Betweenness Centrality
Sort
View
106
Voted
ICALP
2007
Springer
15 years 7 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
115
Voted
ICESS
2007
Springer
15 years 7 months ago
Intra Routing Protocol with Hierarchical and Distributed Caching in Nested Mobile Networks
Abstract. We propose a novel route optimization protocol for intraNEMO communication using a hierarchical and distributed caching scheme. The proposed scheme employs the routing ca...
Hyemee Park, Moonseong Kim, Hyunseung Choo
116
Voted
ICOIN
2007
Springer
15 years 7 months ago
Balanced Multipath Source Routing
Abstract. We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, start...
Shreyas Prasad, André Schumacher, Harri Haa...
104
Voted
IPSN
2007
Springer
15 years 7 months ago
Energy-optimized image communication on resource-constrained sensor platforms
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
Dong-U Lee, Hyungjin Kim, Steven Tu, Mohammad H. R...
126
Voted
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 7 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...