Pages that link to "Item:Q1634801"
From MaRDI portal
The following pages link to Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801):
Displaying 17 items.
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts'' (Q1634803) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
