Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Electronic Notes in Theoretical Computer Science (346): 545-556 (2019)
- Ereignis
-
Veröffentlichung
- (wo)
-
Hamburg
- (wer)
-
Universitätsbibliothek der Technischen Universität Hamburg-Harburg
- (wann)
-
2019
- Urheber
- URN
-
urn:nbn:de:gbv:830-882.060692
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:54 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Jiménez, Andrea
- Schmidt, Tina Janne
- Universitätsbibliothek der Technischen Universität Hamburg-Harburg
Entstanden
- 2019
Ähnliche Objekte (12)
Deciding whether a lattice has an orthonormal basis is in co-NP
Deciding whether a law is constitutional, interpretable, or unconstitutional
Deciding whether a law is constitutional, interpretable, or unconstitutional
Deciding Liveness in Component-Based Systems is NP-hard
Planar Steiner Orientation is NP-complete
Deciding the feasibility of a booking in the European gas market is coNP-hard
On Whether It Is and What It Is
Automating Resolution is NP-Hard
Intersection optimization is NP-complete
NP-Completeness Results for Minimum Planar Spanners
Stable Divisorial Gonality is in NP
Chapter 10: Deciding Whether to Complement a Systematic Review of Medical Tests with Decision Modeling
Deciding whether a lattice has an orthonormal basis is in co-NP
Deciding whether a law is constitutional, interpretable, or unconstitutional
Deciding whether a law is constitutional, interpretable, or unconstitutional
Deciding Liveness in Component-Based Systems is NP-hard
Planar Steiner Orientation is NP-complete
Deciding the feasibility of a booking in the European gas market is coNP-hard
On Whether It Is and What It Is
Automating Resolution is NP-Hard
Intersection optimization is NP-complete
NP-Completeness Results for Minimum Planar Spanners
Stable Divisorial Gonality is in NP
Chapter 10: Deciding Whether to Complement a Systematic Review of Medical Tests with Decision Modeling
Deciding whether a lattice has an orthonormal basis is in co-NP
Deciding whether a law is constitutional, interpretable, or unconstitutional
Deciding whether a law is constitutional, interpretable, or unconstitutional
Deciding Liveness in Component-Based Systems is NP-hard
Planar Steiner Orientation is NP-complete
Deciding the feasibility of a booking in the European gas market is coNP-hard
On Whether It Is and What It Is
Automating Resolution is NP-Hard
Intersection optimization is NP-complete
NP-Completeness Results for Minimum Planar Spanners
Stable Divisorial Gonality is in NP