Pages that link to "Item:Q4565788"
From MaRDI portal
The following pages link to On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (Q4565788):
Displaying 11 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- On the maximum quasi-clique problem (Q1759884) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Preface: Recent advances in telecommunications networks planning and operation (Q4565787) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
- A survey on optimization studies of group centrality metrics (Q6659090) (← links)
