The perfect matching cut problem revisited

In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and show that pmc remains NP-complete when restricted to bipart...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 931; s. 117 - 130
Hlavní autori:	Le, Van Bang, Telle, Jan Arne
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 29.09.2022
Predmet:	Computational complexity Exact branching algorithm Graph algorithm Matching cut Perfect matching cut Matching cut Perfect matching cut Computational complexity Exact branching algorithm Graph algorithm
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!