Sciweavers

2503 search results - page 244 / 501
» A study of 3-arc graphs
Sort
View
DEDS
2010
88views more  DEDS 2010»
15 years 6 months ago
On the Performance Evaluation of Multi-Guarded Marked Graphs with Single-Server Semantics
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
JNW
2008
75views more  JNW 2008»
15 years 6 months ago
Time Efficient Radio Broadcasting in Planar Graphs
Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmis...
Fredrik Manne, Qin Xin
JDA
2007
62views more  JDA 2007»
15 years 6 months ago
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...
Cédric Bentz, Marie-Christine Costa, Fr&eac...
ERSHOV
1999
Springer
15 years 11 months ago
Enhanced Control Flow Graphs in Montages
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
Matthias Anlauff, Philipp W. Kutter, Alfonso Piera...
ACSC
2004
IEEE
15 years 10 months ago
Network Robustness and Graph Topology
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
Anthony H. Dekker, Bernard D. Colbert