Finding an induced subdivision of a digraph (Q5891097)
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: Finding an induced subdivision of a digraph |
scientific article; zbMATH DE number 6064599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding an induced subdivision of a digraph |
scientific article; zbMATH DE number 6064599 |
Statements
Finding an induced subdivision of a digraph (English)
0 references
23 July 2013
0 references
10 August 2012
0 references
digraphs
0 references
NP-completeness
0 references
induced paths and cycles
0 references
linkings
0 references
3-SAT
0 references
0.99999994
0 references
0 references
0 references
0 references
0.8920477
0 references
0.8920477
0 references
0.8873619
0 references
0.88735646
0 references
0 references
