942 search results - page 76 / 189 » Constraints in Graph Drawing Algorithms |
ESA
2005
Springer
14 years 3 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
TOPLAS
2008
13 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
ANOR
2004
13 years 9 months ago
2004
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
PAMI
2010
13 years 8 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...