2503 search results - page 292 / 501 » A study of 3-arc graphs |
144
click to vote
SIAMDM
2002
15 years 5 months ago
2002
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
186
click to vote
JSA
2008
15 years 5 months ago
2008
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...
173
click to vote
RSA
2008
15 years 5 months ago
2008
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
119
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
146
click to vote
JAIR
2010
15 years 4 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...