Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel approximation schemes for problems on planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A parallel algorithm for bisection width in trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The bisection width of grid graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549709 / rank | |||
Normal rank |
Latest revision as of 17:40, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons |
scientific article |
Statements
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (English)
0 references
16 December 2011
0 references