On the computational complexity of the bipartizing matching problem (Q2675722)
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 7592273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of the bipartizing matching problem |
scientific article; zbMATH DE number 7592273 |
Statements
On the computational complexity of the bipartizing matching problem (English)
0 references
26 September 2022
0 references
graph modification problems
0 references
edge bipartization
0 references
defective coloring
0 references
planar graphs
0 references
NP-completeness
0 references
parameterized complexity
0 references
0 references
0 references
0 references
0.91425943
0 references
0.9058709
0 references
0.90457165
0 references
0.9011506
0 references
0.90084016
0 references
0.8996783
0 references
0.8991699
0 references
