Pages that link to "Item:Q3656855"

From MaRDI portal

← Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover (Q3656855)

Jump to:navigation, search

The following pages link to Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover (Q3656855):

Displayed 1 item.

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) ‎ (← links)

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