On the Complexity of Monotone Dualization and Generating Minimal Hypergraph 
Transversals

Elbassioni, Khaled

doi:10.1016/j.dam.2007.05.030

Local TagsRelease HistoryDetailsSummary

On the Complexity of Monotone Dualization and Generating Minimal Hypergraph Transversals

Elbassioni, K. (2008). On the Complexity of Monotone Dualization and Generating Minimal Hypergraph Transversals. Discrete applied mathematics, 156(11), 2109-2123. doi:10.1016/j.dam.2007.05.030.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1C7E-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-96AC-4

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Elbassioni, Khaled¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2009-03-12Published Online: 2008Date issued: 2008

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 428053
DOI: 10.1016/j.dam.2007.05.030
URI: http://dx.doi.org/10.1016/j.dam.2007.05.030
Other: Local-ID: C125756E0038A185-74FB7DD6C55A81A8C1257553004D2118-Elbassioni2008i

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Discrete applied mathematics

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : North-Holland

Pages: - Volume / Issue: 156 (11) Sequence Number: - Start / End Page: 2109 - 2123 Identifier: ISSN: 0166-218X
CoNE: https://pure.mpg.de/cone/journals/resource/954925482629