Sciweavers

1357 search results - page 104 / 272
» Compositionality in Graph Transformation
Sort
View
118
Voted
GG
2004
Springer
15 years 8 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
GD
2003
Springer
15 years 8 months ago
Intersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
LR
2011
108views more  LR 2011»
14 years 6 months ago
Modeling production networks with discrete processes by means of communities of autonomous units
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...
Hans-Jörg Kreowski, Sabine Kuske, Caroline vo...
SSC
2007
Springer
126views Cryptology» more  SSC 2007»
15 years 9 months ago
Randomness and Representation of Span n Sequences
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
Guang Gong
138
Voted
FOIKS
2006
Springer
15 years 7 months ago
Iterative Modification and Incremental Evaluation of Preference Queries
Abstract. We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: ...
Jan Chomicki