Geodesic Convexity in Graphs
From MaRDI portal
Publication:2849538
DOI10.1007/978-1-4614-8699-2zbMath1285.05001OpenAlexW402113276MaRDI QIDQ2849538
Publication date: 20 September 2013
Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8699-2
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Related Items (54)
Convex median and anti-median at prescribed distance ⋮ Complexity aspects of the triangle path convexity ⋮ The geodesic classification problem on graphs ⋮ Near-linear-time algorithm for the geodetic Radon number of grids ⋮ Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Well-partitioned chordal graphs ⋮ Geodeticity of the contour of chordal bipartite graphs ⋮ A general framework for path convexities ⋮ A note on path domination ⋮ Computing the hull number in toll convexity ⋮ STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS ⋮ A note on the convexity number of the complementary prisms of trees ⋮ On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products ⋮ On the toll number of a graph ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ Inapproximability results and bounds for the Helly and Radon numbers of a graph ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ On the monophonic rank of a graph ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ On the hull number on cycle convexity of graphs ⋮ A unifying view on recombination spaces and abstract convex evolutionary search ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Bounds and algorithms for geodetic hulls ⋮ The boundary of a graph and its isoperimetric inequality ⋮ Convex \(p\)-partitions of bipartite graphs ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ \textsc{Minimum Surgical Probing} with convexity constraints ⋮ Three problems on well-partitioned chordal graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Toll number of the strong product of graphs ⋮ A note on the geodetic number and the Steiner number of AT-free graphs ⋮ Steiner convex sets and Cartesian product ⋮ Strong geodetic number of graphs and connectivity ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ On the contour of bipartite graphs ⋮ Toll convexity ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ Boundary-type sets in maximal outerplanar graphs ⋮ Strong geodetic problem in grid-like architectures ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Strong geodetic problem in networks ⋮ On the Carathéodory and exchange numbers of geodetic convexity in graphs ⋮ Strong geodetic cores and Cartesian product graphs ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ Convex and quasiconvex functions in metric graphs ⋮ Complexity aspects of \(\ell\)-chord convexities ⋮ Convex geometries over induced paths with bounded length ⋮ On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
This page was built for publication: Geodesic Convexity in Graphs
