3 search results - page 1 / 1 » On the Capacity of Digraphs |
EJC
1998
14 years 11 months ago
1998
For a digraph G = (V, E) let w(Gn ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair (u1, u2, . . . , un) and (v1, v2, . . . , vn) of m...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
100
click to vote
SIAMDM
2010
14 years 10 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...