Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
From MaRDI portal
Publication:5891860
DOI10.1007/978-3-642-35843-2_24zbMath1303.05195OpenAlexW2996212809MaRDI QIDQ5891860
Mamadou Moustapha Kanté, Lhouari Nourine
Publication date: 4 November 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35843-2_24
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
\(P_3\)-hull number of graphs with diameter two ⋮ On the geodetic hull number of \(P_{k}\)-free graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ A general framework for path convexities ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ On the geodetic iteration number of distance-hereditary graphs ⋮ Convexity in partial cubes: the hull number ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs
This page was built for publication: Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
