Pages that link to "Item:Q448967"
From MaRDI portal
The following pages link to On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967):
Displayed 12 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← 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)
- The triangle \(k\)-club problem (Q2359790) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
