Crossing Number is NP-Complete (Q3320398): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57255585, #quickstatements; #temporary_batch_1711094041063 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology of Thin Film RC Circuits / rank | |||
Normal rank |
Latest revision as of 11:24, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Crossing Number is NP-Complete |
scientific article |
Statements
Crossing Number is NP-Complete (English)
0 references
1983
0 references
optimal embedding
0 references
crossing number
0 references
NP-complete
0 references