On cutting a few vertices from a graph (Q1811082): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating the minimum bisection size (extended abstract) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new approach to the minimum cut problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4856179 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:29, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On cutting a few vertices from a graph |
scientific article |
Statements
On cutting a few vertices from a graph (English)
0 references
10 June 2003
0 references
approximation algorithms
0 references
graph partitioning
0 references
random edge contraction
0 references
dynamic programming
0 references