Sciweavers

1188 search results - page 177 / 238
» Extended Graph Unification
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
COMBINATORICS
2007
90views more  COMBINATORICS 2007»
13 years 8 months ago
Distinguishability of Locally Finite Trees
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
Mark E. Watkins, Xiangqian Zhou
DAM
2007
85views more  DAM 2007»
13 years 8 months ago
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomo...
Wenjun Xiao, Behrooz Parhami
DM
2007
86views more  DM 2007»
13 years 8 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik
SIAMCOMP
2008
80views more  SIAMCOMP 2008»
13 years 8 months ago
The Symmetric Group Defies Strong Fourier Sampling
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
Cristopher Moore, Alexander Russell, Leonard J. Sc...