183 search results - page 7 / 37 » On the Matching Problem for Special Graph Classes |
NIPS
2008
14 years 11 months ago
2008
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
GD
2009
Springer
15 years 2 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...