723 search results - page 112 / 145 » On the hyperbolicity constant in graphs |
171
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
144
click to vote
TIT
2010
15 years 24 days ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
158
click to vote
NAR
2011
14 years 9 months ago
2011
BTO, the BRENDA Tissue Ontology (http://www .BTO.brenda-enzymes.org) represents a comprehensive structured encyclopedia of tissue terms. The project started in 2003 to create a co...
420
click to vote
COCOON
2011
Springer
14 years 5 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
207
click to vote
DIALM
2003
ACM
15 years 11 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...