Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects

DOI10.1007/978-3-540-74208-1_34zbMath1171.05374OpenAlexW1838671497MaRDI QIDQ3603487

Eyal Rozenberg, Eldar Fischer

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Efficient Removal Lemmas for Matrices ⋮ Efficient removal lemmas for matrices ⋮ Earthmover Resilience and Testing in Ordered Structures

This page was built for publication: Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects