9532 search results - page 153 / 1907 » Logic, Graphs, and Algorithms |
199
click to vote
LCC
1994
15 years 3 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
106
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
101
click to vote
ADHOCNOW
2008
Springer
15 years 5 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
COCO
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
106
Voted
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...