Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (Q5890507)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs |
scientific article; zbMATH DE number 6549691
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs |
scientific article; zbMATH DE number 6549691 |
Statements
4 March 2016
0 references
hull number
0 references
geodetic number
0 references
path convexity
0 references
chordal
0 references
distance-hereditary
0 references
0 references
Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (English)
0 references
