Weakly bipartite graphs and the max-cut problem (Q1169411)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weakly bipartite graphs and the max-cut problem |
scientific article; zbMATH DE number 3779122
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weakly bipartite graphs and the max-cut problem |
scientific article; zbMATH DE number 3779122 |
Statements
Weakly bipartite graphs and the max-cut problem (English)
0 references
1981
0 references
polynomial time algorithm
0 references
weakly bipartite graphs
0 references
planar graphs
0 references
max- cut problem
0 references
ellipsoid method
0 references
shortest path
0 references
