446 search results - page 18 / 90 » Extremal Stable Graphs |
AGILEDC
2006
IEEE
14 years 2 months ago
2006
IEEE
We have an Extreme Programming team at a small company dedicated to the Agile approach. Our team of 7 developers decided to use the pairing session as the fundamental unit of work...
FORMATS
2006
Springer
14 years 3 days ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
JGT
2010
13 years 7 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
DM
1999
13 years 8 months ago
1999
We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur