1883 search results - page 61 / 377 » Ordered theta graphs |
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
CP
2007
Springer
14 years 1 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
GD
2004
Springer
14 years 1 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...