6740 search results - page 323 / 1348 » An s -Hamiltonian Line Graph Problem |
141
Voted
VIZSEC
2005
Springer
15 years 9 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
151
click to vote
CCS
2006
ACM
15 years 7 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
119
click to vote
OPODIS
2007
15 years 5 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
206
click to vote
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
177
click to vote
ICDAR
2011
IEEE
14 years 3 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...