Pages that link to "Item:Q360375"
From MaRDI portal
The following pages link to Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375):
Displayed 4 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)