Pages that link to "Item:Q4985780"
From MaRDI portal
The following pages link to Toward Optimal Community Detection: From Trees to General Weighted Networks (Q4985780):
Displaying 8 items.
- Finding weighted \(k\)-truss communities in large networks (Q778465) (← links)
- Community detection with the weighted parsimony criterion (Q904925) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
- Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)