396 search results - page 54 / 80 » Exact Algorithms for Graph Homomorphisms |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
BMCBI
2006
13 years 9 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
IJRR
2002
13 years 8 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
WG
2007
Springer
14 years 3 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
NOMS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...