Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs |
scientific article |
Statements
Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (English)
0 references
18 November 2008
0 references
directed graphs
0 references
property testing
0 references
randomized algorithm
0 references