69 search results - page 4 / 14 » Near automorphisms of cycles |
85
Voted
EJC
2006
14 years 11 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
TPDS
2010
14 years 10 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
WG
1998
Springer
15 years 4 months ago
1998
Springer
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
79
Voted
WSC
2004
15 years 1 months ago
2004
In the analysis of a manufacturing system, the analyst is often interested in the change in mean cycle time as a function of different throughput (start rate) levels. Since the va...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...