Pages that link to "Item:Q482281"

From MaRDI portal

← On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281)

Jump to:navigation, search

The following pages link to On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281):

Displaying 3 items.

On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
Kernels for packing and covering problems (Q2272393) (← links)
An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q482281"