Pages that link to "Item:Q3783310"
From MaRDI portal
The following pages link to Algorithms for maximumk-colorings andk-coverings of transitive graphs (Q3783310):
Displayed 6 items.
- Minimum loss scheduling problems (Q1197941) (← links)
- Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs (Q4301637) (← links)