Sciweavers

248 search results - page 30 / 50
» On the Cayley isomorphism problem
Sort
View
AISC
2008
Springer
14 years 23 days ago
The Monoids of Order Eight and Nine
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
Andreas Distler, Tom Kelsey
IPL
2008
109views more  IPL 2008»
13 years 10 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
DM
2002
114views more  DM 2002»
13 years 10 months ago
C4-saturated bipartite graphs
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
Darryn E. Bryant, Hung-Lin Fu
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 10 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
AIR
2006
46views more  AIR 2006»
13 years 10 months ago
Spatial inference with geometric proportional analogies
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
Emma-Claire Mullally, Diarmuid P. O'Donoghue