1883 search results - page 130 / 377 » Ordered theta graphs |
ECCV
1998
Springer
14 years 9 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
ICST
2009
IEEE
14 years 2 months ago
2009
IEEE
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
PDCAT
2007
Springer
14 years 2 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...