2294 search results - page 232 / 459 » From Path Graphs to Directed Path Graphs |
133
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
114
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
109
click to vote
RSA
2010
15 years 1 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
136
click to vote
DSS
2002
15 years 3 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
127
click to vote
WIRI
2005
IEEE
15 years 8 months ago
2005
IEEE
Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by followi...