Complexity aspects of the Helly property: graphs and hypergraphs.
Dourado, Mitre C.; Protti, Fábio; Szwarcfiter, Jayme L.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: DS17, page 53 p., electronic only-53 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topDourado, Mitre C., Protti, Fábio, and Szwarcfiter, Jayme L.. "Complexity aspects of the Helly property: graphs and hypergraphs.." The Electronic Journal of Combinatorics [electronic only] DS17 (2009): 53 p., electronic only-53 p., electronic only. <http://eudml.org/doc/222810>.
@article{Dourado2009,
author = {Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Helly property; recognition algorithm; computational complexity; NP-hard; NP-complete},
language = {eng},
pages = {53 p., electronic only-53 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Complexity aspects of the Helly property: graphs and hypergraphs.},
url = {http://eudml.org/doc/222810},
volume = {DS17},
year = {2009},
}
TY - JOUR
AU - Dourado, Mitre C.
AU - Protti, Fábio
AU - Szwarcfiter, Jayme L.
TI - Complexity aspects of the Helly property: graphs and hypergraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - DS17
SP - 53 p., electronic only
EP - 53 p., electronic only
LA - eng
KW - Helly property; recognition algorithm; computational complexity; NP-hard; NP-complete
UR - http://eudml.org/doc/222810
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.