Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree

In a graph $ G $, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-hard even for bipartite graphs and is called the maximum dissociation set problem. The complexity of the maximum diss...

Celý popis

Podrobná bibliografia

Vydané v:	AIMS mathematics Ročník 7; číslo 1; s. 569 - 578
Hlavní autori:	Tu, Jianhua, Zhang, Lei, Du, Junfeng, Lang, Rongling
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	AIMS Press 01.01.2022
Predmet:	independent set maximum dissociation set polynomial time algorithm tree
ISSN:	2473-6988, 2473-6988
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!