Sciweavers

1357 search results - page 5 / 272
» Compositionality in Graph Transformation
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 5 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
AGTIVE
2007
Springer
14 years 2 months ago
Programmed Graph Rewriting with DEVS
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
Eugene Syriani, Hans Vangheluwe
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 8 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
BMCBI
2010
82views more  BMCBI 2010»
13 years 8 months ago
Predicting the network of substrate-enzyme-product triads by combining compound similarity and functional domain composition
Background: Metabolic pathway is a highly regulated network consisting of many metabolic reactions involving substrates, enzymes, and products, where substrates can be transformed...
Lei Chen, Kai-Yan Feng, Yu-Dong Cai, Kuo-Chen Chou...
ECEASST
2006
95views more  ECEASST 2006»
13 years 8 months ago
Towards Translating Graph Transformation Approaches by Model Transformations
Abstract. Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars writ...
Frank Hermann, Harmen Kastenberg, Tony Modica