5473 search results - page 81 / 1095 » On the graph isomorphism problem |
128
click to vote
IPL
2008
14 years 12 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
COMBINATORICS
2006
14 years 12 months ago
2006
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...
126
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...