Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594)
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 algorithm for computing a minimum geodetic set in outerplanar graphs |
scientific article; zbMATH DE number 6942971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs |
scientific article; zbMATH DE number 6942971 |
Statements
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (English)
0 references
24 September 2018
0 references
outerplanar graph
0 references
geodetic set
0 references
geodetic hull set
0 references
geodetic number
0 references
geodetic hull number
0 references
geodesic convexity
0 references
0 references
0 references
0.8478391766548157
0 references
0.8475845456123352
0 references
0.8022170066833496
0 references
0.8014803528785706
0 references
