Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129737807, #quickstatements; #temporary_batch_1728062974773 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.05.032 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.05.032 / rank | |||
Normal rank | |||
Latest revision as of 11:32, 11 December 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
0 references
0 references
