STOC 2021
Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 634413565815650374