2004 search results - page 95 / 401 » Sampling from large graphs |
108
click to vote
CSFW
2004
IEEE
15 years 6 months ago
2004
IEEE
We present a new static analysis for reviewing the security of libraries for systems, such as JVMs or the CLR, that rely on stack inspection for access control. We describe its im...
141
click to vote
APVIS
2001
15 years 4 months ago
2001
Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been develo...
106
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
112
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
133
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...