No article text was recorded for this version.
triangle-based community detection
Version 2 of 262 papers88 conceptsfrozen 2026-10-04
Papers in this version
- Blog: K-clique-graphs for Dense Subgraph Discovery
- Blog: Attributed Community Analysis: Global and Ego-centric Views
- Blog: Diversified Top-r Community Search in Geo-Social Network: A K-Truss Based Model
- Blog: Network representation learning based on social similarities
- Blog: Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
- Blog: Discovering Overlapping Communities of Named Entities
- Blog: Truss-based Structural Diversity Search in Large Graphs
- Blog: Decompositions of Triangle-Dense Graphs
- Blog: Detecting Overlapping Communities from Local Spectral Subspaces
- Blog: The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization
- Blog: Scalable Motif-aware Graph Clustering
- Blog: Tiles: an online algorithm for community discovery in dynamic social networks
- Blog: Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis
- Blog: Efficient Triangle-Connected Truss Community Search In Dynamic Graphs
- Blog: Predictive Mining of Comparable Entities from the Web
- Blog: Finding Effective Geo-Social Group for Impromptu Activity with Multiple Demands
- Blog: Finding Theme Communities from Database Networks
- Blog: Triangular Stability Maximization by Influence Spread over Social Networks
- Blog: Decompositions of Triangle-Dense Graphs
- Blog: FirmTruss Community Search in Multilayer Networks
- Blog: Approximate Closest Community Search in Networks
- Blog: Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
- Blog: Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks
- Blog: Reverse Influential Community Search Over Social Networks (Technical Report)
- Blog: Truss Decomposition in Massive Networks
- Blog: OCSM : Finding Overlapping Cohesive Subgraphs with Minimum Degree
- Blog: Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
- Blog: The shape of collaborations
- Blog: STruD: Truss Decomposition of Simplicial Complexes
- Blog: Finding maximal k-edge-connected subgraphs from a large graph
- Blog: Gender homophily in online dyadic and triadic relationships
- Blog: Who to Invite Next? Predicting Invitees of Social Groups
- Blog: Higher-Order Neighborhood Truss Decomposition
- Blog: Counting small cliques in social networks via triangle-preserving decompositions.
- Blog: The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
- Blog: COMICS: a community property-based triangle motif clustering scheme
- Blog: A Graph Degeneracy-based Approach to Keyword Extraction
- Blog: Essentially Tight Kernels for (Weakly) Closed Graphs
- Blog: Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
- Blog: Effective and Efficient Community Search over Large Heterogeneous Information Networks
- Blog: Finding Route Hotspots in Large Labeled Networks
- Blog: Efficient Truss Maintenance in Evolving Networks
- Blog: Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
- Blog: Attribute-Driven Community Search
- Blog: Finding Theme Communities from Database Networks: from Mining to Indexing and Query Answering
- Blog: Motif Clustering and Overlapping Clustering for Social Network Analysis
- Blog: Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
- Blog: Locating influential nodes in complex networks
- Blog: A Survey of Community Search Over Big Graphs
- Blog: Community Recovery in the Geometric Block Model
- Blog: Fine-Grained Semantic Conceptualization of FrameNet
- Blog: Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs
- Blog: Neighborhood-based Hypergraph Core Decomposition
- Blog: Spectral Triadic Decompositions of Real-World Networks
- Blog: PointTruss: K-Truss for Point Cloud Registration
- Blog: Mining Dense Subgraphs with Similar Edges
- Blog: Scalable motif-aware graph clustering
- Blog: EdMot: An Edge Enhancement Approach for Motif-aware Community Detection
- Blog: Keyword Search on Large Graphs: A Survey
- Blog: The Parameterized Complexity of s-Club with Triangle and Seed Constraints
Showing 60 of 62 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_triangle_based_community_detection_d1eebd06,
title = {triangle-based community detection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/triangle-based-community-detection/rdr_d1eebd0602a340ab963b27bc5bbd8f1c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_triangle_based_community_detection_d1eebd06_v2,
title = {triangle-based community detection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/triangle-based-community-detection/rdr_d1eebd0602a340ab963b27bc5bbd8f1c/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}