In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
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...
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...