Pages that link to "Item:Q1949103"

From MaRDI portal

← Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103)

Jump to:navigation, search

The following pages link to Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103):

Displaying 1 item.

An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)

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