Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.032 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2805872963 / rank | |||
Normal rank | |||
Revision as of 19:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs |
scientific article |
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
