55 search results - page 11 / 11 » A Simple MAX-CUT Algorithm for Planar Graphs |
DNA
2006
Springer
13 years 9 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
COCO
2008
Springer
13 years 7 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
CORR
2010
Springer
13 years 16 days ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
CGF
2007
13 years 5 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...