694 search results - page 32 / 139 » Open Graphs and Computational Reasoning |
BMCBI
2007
13 years 9 months ago
2007
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
WG
2010
Springer
13 years 7 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
CVPR
2007
IEEE
14 years 3 months ago
2007
IEEE
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...
WG
2009
Springer
14 years 3 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...