A polynomial algorithm for computing the weak rupture degree of trees (Q2279643): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127676326, #quickstatements; #temporary_batch_1722372779079 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2019.06.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2019.06.019 / rank | |||
Normal rank | |||
Latest revision as of 19:26, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for computing the weak rupture degree of trees |
scientific article |
Statements
A polynomial algorithm for computing the weak rupture degree of trees (English)
0 references
13 December 2019
0 references
graph
0 references
weak rupture degree
0 references
tree
0 references
algorithm
0 references
complexity
0 references
