1729 search results - page 208 / 346 » Bound Graph Polysemy |
142
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
175
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
159
click to vote
JEC
2006
15 years 6 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...