731 search results - page 116 / 147 » Reductions to Graph Isomorphism |
117
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
104
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
127
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
137
click to vote
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
144
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...