Pages that link to "Item:Q261389"

From MaRDI portal

← PTAS for densest \(k\)-subgraph in interval graphs (Q261389)

Jump to:navigation, search

The following pages link to PTAS for densest \(k\)-subgraph in interval graphs (Q261389):

Displaying 1 item.

Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)

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