Pages that link to "Item:Q388790"

From MaRDI portal

← Fast balanced partitioning is hard even on grids and trees (Q388790)

Jump to:navigation, search

The following pages link to Fast balanced partitioning is hard even on grids and trees (Q388790):

Displaying 2 items.

On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
Parameterized complexity of asynchronous border minimization (Q1755787) (← links)

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