Mining Dense Subgraphs with Similar Edges

Cited by: 0|Bibtex|Views26
Other Links: arxiv.org

Abstract:

When searching for interesting structures in graphs, it is often important to take into account not only the graph connectivity, but also the metadata available, such as node and edge labels, or temporal information. In this paper we are interested in settings where such metadata is used to define a similarity between edges. We consider...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments