3268 search results - page 54 / 654 » The hub number of a graph |
104
click to vote
DM
2006
15 years 2 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
124
click to vote
SIAMDM
2000
15 years 1 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
109
click to vote
HICSS
2008
IEEE
15 years 8 months ago
2008
IEEE
—We derive a measure of “electrical centrality” for AC power networks, which describes the structure of the network as a function of its electrical topology rather than its p...
120
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— We propose a contention based reservation MAC protocol for a collaborative sensing scenario involving a set of surveillance UAVs communicating with a hub. Data transmission rig...
105
click to vote
EGOV
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In the CB-BUSINESS project (IST-2001-33147, http://www.cbbusiness.com/), a number of administrative services from public agencies and professional chambers in different c...