The bipartite swapping trick on graph homomorphisms (Q3094936)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5964617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bipartite swapping trick on graph homomorphisms |
scientific article; zbMATH DE number 5964617 |
Statements
The Bipartite Swapping Trick on Graph Homomorphisms (English)
0 references
27 October 2011
0 references
graph homomorphism
0 references
independent set
0 references
graph coloring
0 references
stable set polytope
0 references
0.8193721771240234
0 references
0.7865996360778809
0 references
0.7803348898887634
0 references
0.7798113822937012
0 references
0.7690334320068359
0 references
