Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
type: Item
instance of: scholarly article
title: Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
zbMATH Open document ID: 1405.05181
author: Manuela Blaum
author: Javier Marenco
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7027133
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: discrete convexity
zbMATH Keywords: Hull number
zbMATH Keywords: facet-defining inequalities
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.013
OpenAlex ID: W2895968540
cites work: Irreversible conversion of graphs
cites work: On the convexity of paths of length two in undirected graphs
cites work: On triangle path convexity in graphs
cites work: On the Approximability of Influence in Social Networks
cites work: Complexity results related to monophonic convexity
cites work: Complexity aspects of the triangle path convexity
cites work: Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
cites work: The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
cites work: Largest and smallest minimal percolating sets in trees
cites work: Q3141898
cites work: Q4254875
DOI: 10.1016/J.DAM.2018.08.013
description: scientific article; zbMATH DE number 7027133