Sciweavers

1550 search results - page 220 / 310
» Benchmarking for Graph Transformation
Sort
View
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 11 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
DC
2002
13 years 11 months ago
Restoration by path concatenation: fast recovery of MPLS paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...
JSA
2008
131views more  JSA 2008»
13 years 10 months ago
Formal verification of ASMs using MDGs
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...
Amjad Gawanmeh, Sofiène Tahar, Kirsten Wint...
PVLDB
2008
118views more  PVLDB 2008»
13 years 10 months ago
XTCcmp: XQuery compilation on XTC
XTCcmp, the XQuery Compiler of a native XML database system, extends Starburst's well-known Query Graph Model to serve as an internal representation and basis for query restr...
Christian Mathis, Andreas M. Weiner, Theo Här...
MST
2010
107views more  MST 2010»
13 years 9 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...