Complexity aspects of generalized Helly hypergraphs
type: Item
instance of: scholarly article
title: Complexity aspects of generalized Helly hypergraphs
zbMATH Open document ID: 1184.05086
author: Mitre C. Dourado
author: Fábio Protti
author: Jayme L. Szwarcfiter
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 5664451
zbMATH Keywords: Helly property
zbMATH Keywords: Helly hypergraphs
zbMATH Keywords: intersecting sets
zbMATH Keywords: computational complexity
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.02.007
OpenAlex ID: W1996303391
cites work: Q4071273
cites work: Q4088860
cites work: Q3726125
cites work: Graph Classes: A Survey
cites work: On domination problems for permutation and other graphs
cites work: An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
cites work: Induced matchings
cites work: Graph-Theoretic Concepts in Computer Science
cites work: The Helly property on subfamilies of limited size
cites work: Q3439664
cites work: Q4200096
cites work: Q4871755
cites work: Q4198056
cites work: The edge intersection graphs of paths in a tree
cites work: Line Graphs of Helly Hypergraphs
cites work: Extremal bi-Helly families
cites work: Q4842710
DOI: 10.1016/J.IPL.2006.02.007
description: scientific article; zbMATH DE number 5664451