1756 search results - page 5 / 352 » Directed scale-free graphs |
CP
2007
Springer
14 years 1 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
TON
2012
11 years 10 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...