5889 search results - page 273 / 1178 » Graph Layout Problems |
177
click to vote
ER
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Locating specific chunks (records) of information within documents on the web is an interesting and nontrivial problem. If the problem of locating and separating records...
173
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
182
click to vote
VIZSEC
2005
Springer
16 years 4 days 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...
185
click to vote
CCS
2006
ACM
15 years 10 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...
151
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...