Pages that link to "Item:Q703275"
From MaRDI portal
The following pages link to The combinatorics of pivoting for the maximum weight clique. (Q703275):
Displaying 4 items.
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- On independent cliques and linear complementarity problems (Q2095085) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
