177 search results - page 25 / 36 » arc 2008 |
ENDM
2008
13 years 7 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
ENTCS
2008
13 years 7 months ago
2008
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
DM
2006
13 years 7 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...
JSW
2008
13 years 7 months ago
2008
A typical tabular business report contains a set of cells. The cells may contain raw numeric values, character labels, and formulas. This paper will present a bottom-up algorithm f...
NETWORKS
2008
13 years 7 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...