163 search results - page 6 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
ECOOP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Aspect-oriented systems claim to improve modularity by providing explicit mechanisms that allow modularization of concerns which crosscut the object-oriented decompositio...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
WG
2009
Springer
14 years 2 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...