Computing simple-path convex hulls in hypergraphs

Authors:
Francesco M. Malvestuto;Mauro Mezzini;Marina Moscarini
Affiliations:
Computer Science Dept., Sapienza University of Rome, Italy;Computer Science Dept., Sapienza University of Rome, Italy;Computer Science Dept., Sapienza University of Rome, Italy
Venue:
Information Processing Letters
Year:
2011

Citing 6
Cited 1

Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
Convex sets in graphs, II. Minimal path convexity

Journal of Combinatorial Theory Series A
Hypergraphs

Handbook of combinatorics (vol. 1)
Steiner distance and convexity in graphs

European Journal of Combinatorics
Steiner Trees and Convex Geometries

SIAM Journal on Discrete Mathematics
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs

Theoretical Computer Science

On the contour of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

In a connected hypergraph a vertex set X is simple-path convex (sp-convex, for short) if either |X|=