Mining Triangle-Dense Subgraphs of a Fixed Size: Hardness, Lovász Extension and Applications
- 1 July 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (7) , 4556-4568
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Main Core Retention on Graph-of-Words for Single-Document Keyword Extraction2015
- A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite TermsJournal of Optimization Theory and Applications, 2012
- Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs2010
- Finding Dense Subgraphs with Size Bounds2009
- On Finding Dense Subgraphs2009
- Submodular Functions, Matroids, and Certain Polyhedra2003
- The Dense k -Subgraph ProblemAlgorithmica, 2001
- Greedy Approximation Algorithms for Finding Dense Components in a Graph2000
- Submodular functions and convexity1983
- Reducibility among Combinatorial Problems1972