A polynomial algorithm for computing the weak rupture degree of trees (Q2279643): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:45, 2 February 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
