Convexity in Partial Cubes: The Hull Number
From MaRDI portal
Publication:5405061
DOI10.1007/978-3-642-54423-1_37zbMath1405.68233arXiv1309.5724OpenAlexW1801634951MaRDI QIDQ5405061
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5724
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ Complexity aspects of the triangle path convexity ⋮ On the geodetic hull number of \(P_{k}\)-free graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ The geodetic hull number is hard for chordal graphs ⋮ The Geodetic Hull Number is Hard for Chordal Graphs ⋮ Computing the hull number in \(\Delta \)-convexity ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs
This page was built for publication: Convexity in Partial Cubes: The Hull Number
