On complementarily transitivity of graphs

•We show that the Maximum Complementarily Transitivity Decision Problem is NP-complete for chordal graphs and bipartite graphs. We also show that the decision version of this problem is still NP-complete for two subclasses of bipartite graphs: star-convex bipartite graphs and perfect elimination bip...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1058; s. 115582
Hlavný autor:	Santra, Kamal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 22.12.2025
Predmet:	Bipartite chain graphs Chordal graphs Complementarily transitivity Linear-time algorithms NP-completeness Star-convex bipartite graphs Star-convex bipartite graphs Bipartite chain graphs Complementarily transitivity Linear-time algorithms Chordal graphs NP-completeness
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!