Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and HHD-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets in graphs. II: Minimal path convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing simple-path convex hulls in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical and monophonic convexities in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridged graphs and geodesic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic Convexity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block decomposition approach to compute a minimum geodetic set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of the hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hull number of some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Partial Cubes: The Hull Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic hull number of \(P_{k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geodetic Hull Number is Hard for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hull number: \(P_5\)-free graphs and reduction rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hull Number of Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining outerplanarity using segment graphs / rank
 
Normal rank

Revision as of 15:40, 16 July 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
    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