LATIN 2004: Theoretical Informatics

DOI10.1007/b95852zbMath1196.05057OpenAlexW2475444492MaRDI QIDQ5901668

Vladimir A. Gurvich, Endre Boros, Khaled M. Elbassioni, Leonid G. Khachiyan

Publication date: 7 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95852

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem ⋮ A global parallel algorithm for the hypergraph transversal problem ⋮ On vertex independence number of uniform hypergraphs ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Computational aspects of monotone dualization: a brief survey ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Efficient enumeration of dominating sets for sparse graphs ⋮ A study on monotone self-dual Boolean functions ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Unnamed Item ⋮ On the structure of linear programs with overlapping cardinality constraints ⋮ On the fractional chromatic number of monotone self-dual Boolean functions ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms ⋮ Unnamed Item ⋮ Asymptotically optimal dualization algorithms

This page was built for publication: LATIN 2004: Theoretical Informatics