Crossing Number is NP-Complete (Q3320398): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0604033 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060538865 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57255585 / rank | |||
Normal rank | |||
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