990 search results - page 47 / 198 » Sub-Graphs of Complete Graph |
DSN
2011
IEEE
12 years 8 months ago
2011
IEEE
— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
COCO
2006
Springer
14 years 15 days ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
EJC
2006
13 years 8 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
CONCUR
2004
Springer
14 years 2 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...