Finding an induced subdivision of a digraph (Q5891097): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding an induced subdivision of a digraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Corrigendum to: On the complexity of testing for odd holes and induced odd paths / rank | |||
Normal rank | |||
Latest revision as of 15:26, 6 July 2024
scientific article; zbMATH DE number 6064599
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
