128 search results - page 9 / 26 » Isomorphic Subgraphs |
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
ALGORITHMICA
2008
13 years 7 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...