150 search results - page 5 / 30 » Polynomial graph invariants from homomorphism numbers |
74
Voted
PVLDB
2010
14 years 8 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
120
click to vote
LICS
2000
IEEE
15 years 2 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
COMBINATORICA
2007
14 years 9 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...