Sciweavers

3008 search results - page 190 / 602
» Independence in connected graphs
Sort
View
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
15 years 6 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
CCS
2006
ACM
15 years 10 months ago
A scalable approach to attack graph generation
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...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
HT
2010
ACM
15 years 8 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 10 months ago
Symmetrizations for clustering directed graphs
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...
Venu Satuluri, Srinivasan Parthasarathy
SIBGRAPI
2006
IEEE
16 years 17 days ago
Increasing statistical power in medical image analysis
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
Alexei Manso Correa Machado