1133 search results - page 77 / 227 » Basics of Graph Cuts |
154
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
123
click to vote
DM
1998
15 years 3 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
137
click to vote
JCT
2002
15 years 3 months ago
2002
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
119
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
119
click to vote
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...