Efficient Algorithms for Finding a Core of a Tree with a Specified Length (Q4881403)
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: Efficient Algorithms for Finding a Core of a Tree with a Specified Length |
scientific article; zbMATH DE number 885496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for Finding a Core of a Tree with a Specified Length |
scientific article; zbMATH DE number 885496 |
Statements
Efficient Algorithms for Finding a Core of a Tree with a Specified Length (English)
0 references
9 June 1996
0 references
core of a graph
0 references
0.8906947374343872
0 references
0.8541117906570435
0 references
0.8535870909690857
0 references
0.8503995537757874
0 references
