@article{Evans2009LineGO,
title={Line graphs of weighted networks for overlapping communities},
author={Tim S. Evans and Renaud Lambiotte},
journal={The European Physical Journal B},
year={2009},
volume={77},
pages={265-272},
url={https://api.semanticscholar.org/CorpusID:119504507}
}The idea to partition the edges of a weighted graph in order to uncover overlapping communities of its nodes is developed, based on the construction of different types of weighted line graphs, that encapsulate differently the relations between the edges.
An unexpected error occurred. Please try again.
Ask another question that can be answered by this paper or rephrase your question.
We are still processing this paper
Question Answering Unavailable
The server took too long to answer your question. You can either rephrase your question or wait until it is less busy.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4