scientific article; zbMATH DE number 7826445
From MaRDI portal
Publication:6124760
DOI10.57717/cgt.v3i2.40arXiv2302.13276MaRDI QIDQ6124760
Publication date: 2 April 2024
Full work available at URL: https://arxiv.org/abs/2302.13276
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Sphere and dot product representations of graphs
- Fixed points, Nash equilibria, and the existential theory of the reals
- Some provably hard crossing number problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Intersection graphs of segments
- Integer realizations of disk and segment graphs
- Representing graphs and hypergraphs by touching polygons in 3D
- d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math>
- Complexity of Some Geometric and Topological Problems
- On Restricted Nonnegative Matrix Factorization
- A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
- The Art Gallery Problem is ∃ℝ-complete
- Smoothing the Gap Between NP and ER
This page was built for publication:
