Realizability of Graphs and Linkages
From MaRDI portal
Publication:2847921
DOI10.1007/978-1-4614-0110-0_24zbMath1272.05135OpenAlexW41260695WikidataQ57382220 ScholiaQ57382220MaRDI QIDQ2847921
Publication date: 25 September 2013
Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_24
Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
The fiber dimension of a graph ⋮ On the distance and multidistance graph embeddability problem ⋮ Smoothing the Gap Between NP and ER ⋮ The complexity of reachability in parametric Markov decision processes ⋮ On complexity of multidistance graph recognition in \(\mathbb{R}^1\) ⋮ The complexity of the Hausdorff distance ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ On the Complexity of the Planar Slope Number Problem ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Fixed points, Nash equilibria, and the existential theory of the reals ⋮ The real computational complexity of minmax value and equilibrium refinements in multi-player games ⋮ Unnamed Item ⋮ The complexity of tensor rank ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ On the computational complexity of decision problems about multi-player Nash equilibria ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ Computational complexity of multi-player evolutionarily stable strategies
Uses Software
