A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696)
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: A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter |
scientific article |
Statements
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (English)
0 references
2 May 2019
0 references
matching cut
0 references
NP-hardness
0 references
graph algorithm
0 references
computational complexity
0 references
dichotomy theorem
0 references
decomposable graph
0 references
0.9901135563850404
0 references
0.8662846088409424
0 references
0.8267749547958374
0 references
