524 search results - page 64 / 105 » Temporal reachability graphs |
142
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
123
click to vote
ICSE
2001
IEEE-ACM
15 years 8 months ago
2001
IEEE-ACM
Mocha is a model checker based on the theme of exploiting design modularity: instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling fra...
119
Voted
OTM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
220
Voted
FSTTCS
2010
Springer
15 years 25 days ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
134
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...