Pages that link to "Item:Q2820114"
From MaRDI portal
The following pages link to Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114):
Displayed 12 items.
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Density-based modularity for evaluating community structure in bipartite networks (Q1749921) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- Projection-based link prediction in a bipartite network (Q2282312) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)