Generating maximal independent sets for hypergraphs with bounded edge-intersections

Conference proceeding

Peer reviewed

Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan

Lecture notes in computer science, Vol.2976, pp.488-498

LATIN 2004 : theoretical informatics (Buenos Aires, 5-8 April 2004)

2004

Abstract

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

General

Theoretical computing

6 Record Views

Title: Generating maximal independent sets for hypergraphs with bounded edge-intersections
Creators: Endre Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Khaled Elbassioni - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Vladimir Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Leonid Khachiyan - Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, Piscataway NJ 08854-8003, United States
Publication Details: Lecture notes in computer science, Vol.2976, pp.488-498
Conference: LATIN 2004 : theoretical informatics (Buenos Aires, 5-8 April 2004)
Date published: 2004
Publisher: Springer
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031666267704646