Pages that link to "Item:Q1600883"
From MaRDI portal
The following pages link to An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883):
Displayed 17 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- 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)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)