1188 search results - page 76 / 238 » Extended Graph Unification |
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
122
click to vote
DBSEC
2008
15 years 1 months ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
122
Voted
IM
2007
15 years 21 days ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
90
Voted
MST
2010
14 years 11 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
101
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...