723 search results - page 93 / 145 » On the hyperbolicity constant in graphs |
225
click to vote
MST
2010
15 years 27 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
146
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
126
click to vote
WDAG
2009
Springer
16 years 21 days ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
170
click to vote
TAMC
2009
Springer
16 years 20 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
167
click to vote
ICRA
2007
IEEE
16 years 13 days ago
2007
IEEE
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...