5473 search results - page 243 / 1095 » On the graph isomorphism problem |
203
click to vote
CCS
2006
ACM
15 years 11 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...
166
click to vote
OPODIS
2007
15 years 8 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...
277
click to vote
EDBT
2011
ACM
14 years 10 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...
260
click to vote
ICDAR
2011
IEEE
14 years 6 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...
209
click to vote
APPROX
1998
Springer
15 years 11 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...