Sciweavers

2503 search results - page 461 / 501
» A study of 3-arc graphs
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
ECCC
2006
88views more  ECCC 2006»
13 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
ENTCS
2006
183views more  ENTCS 2006»
13 years 7 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...
IJSI
2008
91views more  IJSI 2008»
13 years 7 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...