Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Testing whether a digraph contains H-free k-induced subgraphs |
scientific article; zbMATH DE number 5368356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs |
scientific article; zbMATH DE number 5368356 |
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
0 references
0.8400346040725708
0 references
0.8393265008926392
0 references
0.7941380739212036
0 references
0.765527069568634
0 references
