A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129037185, #quickstatements; #temporary_batch_1729944292326 |
Normalize DOI. |
||
| (One intermediate revision by the same user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.10.029 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.10.029 / rank | |||
Normal rank | |||
Latest revision as of 07:23, 11 December 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
