1461 search results - page 241 / 293 » Complexity of Graph Covering Problems |
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
ALMOB
2006
13 years 8 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
VISUALIZATION
2005
IEEE
14 years 2 months ago
2005
IEEE
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
IWDC
2005
Springer
14 years 2 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
ICDAR
2003
IEEE
14 years 2 months ago
2003
IEEE
er presents an approach to deriving an abstract geometric model of a table from a physical representation. The technique developed uses a graph of constraints between cells which ...