Sciweavers

325 search results - page 44 / 65
» Hamilton cycles in random graphs and directed graphs
Sort
View
WWW
2011
ACM
13 years 2 months ago
Finding hierarchy in directed online social networks
Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarch...
Mangesh Gupte, Pravin Shankar, Jing Li, S. Muthukr...
PVLDB
2010
149views more  PVLDB 2010»
13 years 6 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
JMLR
2008
120views more  JMLR 2008»
13 years 7 months ago
Causal Reasoning with Ancestral Graphs
Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distr...
Jiji Zhang
DAM
2000
137views more  DAM 2000»
13 years 7 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
JSAC
2007
97views more  JSAC 2007»
13 years 7 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li