18 search results - page 1 / 4 » Conditionally Critical Indecomposable Graphs |
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
COMBINATORICS
1999
13 years 4 months ago
1999
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
GG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
HYBRID
1998
Springer
13 years 9 months ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
ENTCS
2006
13 years 4 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...