4066 search results - page 176 / 814 » Almost Complete Sets |
182
click to vote
MVA
1990
15 years 7 months ago
1990
We describe a method based on the Hough transform to compute a set of parameters that completely describe line segments. By complete, we mean the description includes the endpoint...
191
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
157
click to vote
DM
2006
15 years 6 months ago
2006
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
184
click to vote
JSYML
2010
15 years 1 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...