Testing whether a digraph contains H-free k-induced subgraphs
From MaRDI portal
Publication:955032
DOI10.1016/J.TCS.2008.08.033zbMATH Open1153.68040OpenAlexW2069646494MaRDI QIDQ955032FDOQ955032
Authors: Hong-Yiu Lin, Yuh-Dauh Lyuu, Tak-Man Ma, Yen-Wu Ti 
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.033
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Cites Work
- Property testing and its connection to learning and approximation
- Efficient testing of large graphs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Title not available (Why is that?)
- On a problem of K. Zarankiewicz
- Testing monotonicity
- A combinatorial characterization of the testable graph properties, it's all about regularity
- A sublinear bipartiteness tester for bounded degree graphs
- Title not available (Why is that?)
- Testing subgraphs in directed graphs
- Testing versus estimation of graph properties
- Tolerant property testing and distance approximation
- Testing problems with sublearning sample complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete subgraphs are elusive
- Tolerant versus intolerant testing for Boolean properties
- Balanced coloring of bipartite graphs
- Title not available (Why is that?)
- On the time required to detect cycles and connectivity in graphs
Cited In (3)
This page was built for publication: Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955032)
