Sciweavers

400 search results - page 51 / 80
» On some Properties of DNA Graphs
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
ICMT
2011
Springer
12 years 11 months ago
Toward Bidirectionalization of ATL with GRoundTram
ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form ca...
Isao Sasano, Zhenjiang Hu, Soichiro Hidaka, Kazuhi...
GG
2004
Springer
14 years 1 months ago
Adhesive High-Level Replacement Categories and Systems
Abstract. Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the w...
Hartmut Ehrig, Annegret Habel, Julia Padberg, Ulri...
DM
2002
92views more  DM 2002»
13 years 7 months ago
A local-global principle for vertex-isoperimetric problems
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
Sergei L. Bezrukov, Oriol Serra
SCAM
2008
IEEE
14 years 2 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes