Sciweavers

1097 search results - page 32 / 220
» Testing Graph Isomorphism
Sort
View
JCT
2008
84views more  JCT 2008»
14 years 9 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
IDA
2007
Springer
14 years 9 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
IJCAI
2007
14 years 11 months ago
Multipotential Games
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
Dov Monderer
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
GC
2010
Springer
14 years 7 months ago
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
Michael Ferrara, Michael S. Jacobson, Angela Harri...