2304 search results - page 107 / 461 » On the Vulnerability of Large Graphs |
162
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
134
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...
162
click to vote
DAGSTUHL
2000
15 years 7 months ago
2000
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
146
Voted
FOSSACS
2009
Springer
16 years 26 days ago
2009
Springer
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...
160
click to vote
RAID
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Embedded network devices have become an ubiquitous fixture in the modern home, office as well as in the global communication infrastructure. Devices like routers, NAS ap...