A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1804.11102 / rank | |||
Normal rank | |||
Revision as of 21:38, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
