488 search results - page 21 / 98 » Automorphic Decompositions of Graphs |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
JAPLL
2008
13 years 7 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
WEA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
DM
2008
13 years 7 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...