A note on the size of minimal covers
DOI10.1016/J.IPL.2006.10.012zbMATH Open1184.68263OpenAlexW2128005025MaRDI QIDQ845985FDOQ845985
Edward Hermann Haeusler, Vaston Costa, Loana T. Nogueira, Eduardo S. Laber
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.012
computational complexitygraphstheory of computationvertex coverBoolean functionsfinite combinatorial problems
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Complexity measures and decision tree complexity: a survey.
- Query strategies for priced information
- The critical complexity of all (monotone) boolean functions and monotone graph properties
- A new strategy for querying priced information
- On the competitive ratio of evaluating priced functions
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
Cited In (10)
- Counting the number of vertex covers in a trapezoid graph
- Title not available (Why is that?)
- On the minimal cover property in \(\mathbf{ZF}\)
- Title not available (Why is that?)
- Minimum resolvable coverings with small parallel classes
- A note on small covers over cubes
- \textsc{MAX MIN} vertex cover and the size of Betti tables
- On the Size of Minimum Super Arrovian Domains
- A note on the core: minimal conversely consistent enlargement
- AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS
This page was built for publication: A note on the size of minimal covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845985)
