Computing simple-path convex hulls in hypergraphs
type: Item
instance of: scholarly article
title: Computing simple-path convex hulls in hypergraphs
zbMATH Open document ID: 1259.05170
author: Mauro Mezzini
author: Marina Moscarini
author: Francesco M. Malvestuto
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6150260
zbMATH Keywords: graph algorithms
zbMATH Keywords: simple-path convexity
zbMATH Keywords: simple-path convex hull
zbMATH Keywords: totally balanced hypergraphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.11.026
OpenAlex ID: W1964105054
cites work: Characterizations of totally balanced matrices
cites work: Steiner distance and convexity in graphs
cites work: On triangle path convexity in graphs
cites work: The All-Paths Transit Function of a Graph
cites work: Convex sets in graphs. II: Minimal path convexity
cites work: Q4871755
cites work: Convexity in Graphs and Hypergraphs
cites work: Canonical and monophonic convexities in hypergraphs
cites work: On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
cites work: Steiner Trees and Convex Geometries
DOI: 10.1016/J.IPL.2010.11.026
description: scientific article; zbMATH DE number 6150260