Sciweavers

803 search results - page 87 / 161
» Independence in Direct-Product Graphs
Sort
View
100
Voted
STACS
2010
Springer
15 years 7 months ago
Relaxed Spanners for Directed Disk Graphs
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
David Peleg, Liam Roditty
95
Voted
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
15 years 2 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 27 days ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 27 days ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
COMCOM
2006
154views more  COMCOM 2006»
15 years 25 days ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia