Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Linear time solvable optimization problems on graphs of bounded clique-width
Incidence matrices and interval graphs
Convexity in Graphs and Hypergraphs
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
On rigid circuit graphs
The theory of convex geometries
Candidate keys for relations
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
On the computation of the hull number of a graph
Distance-hereditary graphs
On triangle path convexity in graphs
Geodesic Convexity in Graphs
Computing Minimum Geodetic Sets of Proper Interval Graphs
Some remarks on the geodetic number of a graph
Complexity results related to monophonic convexity
The hull number of a graph
On the hull number of some graph classes
On the Hull Number of Triangle-Free Graphs
Convexity and HHD-Free Graphs
On the geodetic and the hull numbers in strong product graphs
Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
Enumeration of the Monomials of a Polynomial and Related Complexity Classes
Finding Branch-Decompositions and Rank-Decompositions
The multiple facets of the canonical direct unit implicational basis
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
On the Steiner, geodetic and hull numbers of graphs
On the hull number of a graph.
Graphs with few \(P_4\)'s under the convexity of paths of order three
The hull number of an oriented graph

Cited In (9)

Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
The geodetic hull number is hard for chordal graphs
The Geodetic Hull Number is Hard for Chordal Graphs
Extended dualization: application to maximal pattern mining
Algorithms and complexity for geodetic sets on partial grids
Computing the hull number in toll convexity
A polynomial time algorithm for geodetic hull number for complementary prisms
Two classes of graphs in which some problems related to convexity are efficiently solvable
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs

This page was built for publication: Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890507)