458 search results - page 14 / 92 » Totally magic graphs |
CIMAGING
2009
13 years 9 months ago
2009
We introduce "contour stencils" as a simple method for detecting the local orientation of image contours and apply this detection to image zooming. Our approach is motiv...
ALGORITHMICA
2002
13 years 8 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
SIAMDM
2008
13 years 8 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
MOR
2007
13 years 8 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...