Group adjacency matrices: Effective visualisation of community structure in large networks
Explore this paper's citation graph
- Type
- article
- Published
- 2014-10-13
- Cited by
- 0
- References
- 7
- OpenAlex
- https://openalex.org/W2074815895
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:16402279
Keywords
Adjacency matrix, Visualization, Computer science, Adjacency list, Theoretical computer science
References
- Finding community structure in networks using the eigenvectors of matrices.
- An Information Flow Model for Conflict and Fission in Small Groups
- Community detection in graphs
- A Journey to the Core of the Blogosphere
- Fast unfolding of communities in large networks
- Partitioning Approach to Visualization of Large Graphs
Cited by
No citing papers recorded for this paper.
Related papers
- Adjacency Maps and Efficient Graph Algorithms
- Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship
- Compressed Adjacency Matrices: Untangling Gene Regulatory Networks
- A general method for finding principal resonance structures for conjugated systems by semi-random searching of an adjacency matrix
- DIRECTED GRAPHS AND THEIR ADJACENCY MATRICES: MISCONCEPTIONS AND MORE EFFICIENT METHODS
- Do chemical graphs have a natural order? some regularities of a “compacted maximal adjacency code”
- Evaluating taxonomic adjacency as a source of soil map uncertainty
- Extension of adjacency matrix in QSPR analysis