Sciweavers

731 search results - page 4 / 147
» Reductions to Graph Isomorphism
Sort
View
GG
2008
Springer
13 years 8 months ago
A Decentralized Implementation of Mobile Ambients
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
Fabio Gadducci, Giacoma Valentina Monreale
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
13 years 7 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
AMAI
2004
Springer
14 years 26 days ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Justin Pearson
JCT
2008
68views more  JCT 2008»
13 years 7 months ago
Pseudo 2-factor isomorphic regular bipartite graphs
A graph is pseudo 2
Marien Abreu, A. A. Diwan, Bill Jackson, Domenico ...
ITA
2006
163views Communications» more  ITA 2006»
13 years 7 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...