Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594)

From MaRDI portal
Revision as of 15:40, 16 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
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
    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

    Identifiers