355 search results - page 58 / 71 » On Central Spanning Trees of a Graph |
122
click to vote
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
126
Voted
NETWORKING
2008
15 years 2 months ago
2008
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
104
Voted
PDPTA
2003
15 years 2 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
129
Voted
DISOPT
2010
15 years 25 days ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
101
click to vote
GC
2008
Springer
15 years 25 days ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...