3267 search results - page 165 / 654 » Generalized quasirandom graphs |
168
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
188
click to vote
CCS
2007
ACM
16 years 22 days ago
2007
ACM
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...
179
click to vote
STOC
2006
ACM
16 years 15 days ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
142
click to vote
WSC
2007
15 years 8 months ago
2007
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
169
click to vote
JDA
2008
15 years 6 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...