Abstract: Graph pattern queries (GPQ) over RDF graphs extend basic graph patterns to support variable-length paths (VLP), thereby enabling complex knowledge retrieval and navigation. Generally, ...
We propose a hybrid methodology to evaluate the alignment between structural communities inferred from interaction networks and the linguistic coherence of users' textual production in online social ...
Humans collaborate in different contexts such as in creative or scientific projects, in workplaces and in sports. Depending on the project and external circumstances, a newly formed collaboration may ...
Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. Article Views are the COUNTER-compliant sum of full text article downloads since ...
In this paper, we present two divide-and-conquer algorithms for clustering large graphs. Both algorithms apply a base algorithm on several small subgraphs and then use these individual local ...
Abstract: This paper studies the relationship between the clustering coefficient of nodes and the community structure of the network. Communities in a network are regarded as node-induced subgraphs of ...
The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...
RI is a general purpose algorithm for one-to-one exact subgraph isomorphism problem maintaining topological constraints. It is both a C++ library and a standalone tool, providing developing API and a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results