Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree |
scientific article |
Statements
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (English)
0 references
25 April 2022
0 references
maximum dissociation set
0 references
tree
0 references
polynomial time algorithm
0 references
independent set
0 references
0 references
0.88397634
0 references
0.88301635
0 references
0.8684976
0 references
0.8602633
0 references
0 references
0.8596978
0 references
0.85851425
0 references
0.8575399
0 references
0 references
