267 search results - page 9 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
CBSE
2006
Springer
14 years 12 days ago
2006
Springer
We present a novel approach which facilitates formal verification of component-based software application families using model checking. This approach enables effective composition...
WG
1995
Springer
14 years 6 days ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
TCS
2008
13 years 8 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
ACSD
2005
IEEE
14 years 2 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...