3265 search results - page 106 / 653 » Representing Groups on Graphs |
131
click to vote
ACTA
2006
15 years 3 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
137
Voted
MICS
2008
15 years 3 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
123
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
113
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
134
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...