2695 search results - page 199 / 539 » Learning Graph Matching |
114
click to vote
ORL
2008
15 years 3 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
116
click to vote
EJC
2000
15 years 3 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
123
click to vote
GBRPR
2005
Springer
15 years 8 months ago
2005
Springer
Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper,...
155
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
137
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...