The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: XMP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Facets of the knapsack polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Optimal Partitioning of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3753826 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997942 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Solution to the Partitioning of General Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A projection technique for partitioning the nodes of a graph / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 17:54, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts |
scientific article |
Statements
The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (English)
0 references
29 June 1993
0 references
graph partitioning
0 references
combinatorial cuts
0 references