446 search results - page 75 / 90 » A fast algorithm for computing steiner edge connectivity |
CCCG
2009
13 years 8 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
BROADNETS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
SAC
2003
ACM
14 years 22 days ago
2003
ACM
Image retrieval based on content from digital libraries, multimedia databases, the Internet, and other sources has been an important problem addressed by several researchers. In t...
ALGORITHMICA
2011
13 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...