102 search results - page 11 / 21 » Spanning trees with minimum weighted degrees |
207
click to vote
ACID
2006
15 years 7 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
191
click to vote
FOCS
2008
IEEE
16 years 15 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
175
click to vote
WAOA
2007
Springer
16 years 4 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
158
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
135
click to vote
BIRTHDAY
2009
Springer
16 years 25 days ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...