Sciweavers

731 search results - page 34 / 147
» Reductions to Graph Isomorphism
Sort
View
IDA
2007
Springer
13 years 8 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
ICFP
2010
ACM
13 years 9 months ago
The reduceron reconfigured
The leading implementations of graph reduction all target conventional processors designed for low-level imperative execution. In this paper, we present a processor specially desi...
Matthew Naylor, Colin Runciman
IJCAI
2007
13 years 10 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»
13 years 8 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
13 years 6 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...