Sphere and dot product representations of graphs
From MaRDI portal
Recommendations
Cites work
- Algorithms in real algebraic geometry
- Dot product representations of graphs
- Efficient graph representations
- Embeddings of graphs in Euclidean spaces
- Geometrical embeddings of graphs
- scientific article; zbMATH DE number 3815705 (Why is no real title available?)
- scientific article; zbMATH DE number 17663 (Why is no real title available?)
- scientific article; zbMATH DE number 2109336 (Why is no real title available?)
- Implicat Representation of Graphs
- Integer realizations of disk and segment graphs
- On embedding of graphs into Euclidean spaces of small dimension
- On the combinatorial and algebraic complexity of quantifier elimination
- Optimal greedy algorithms for indifference graphs
- Oriented Matroids
- Realizability of combinatorial types of convex polyhedra over fields
- Space graphs and sphericity
- The number of bits needed to represent a unit disk graph
- Threshold graphs and related topics
- Unit disk graph recognition is NP-hard
Cited in
(49)- Dot product representations of graphs
- The structure of spherical graphs.
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- Implicit representation conjecture for semi-algebraic graphs
- Optimization problems over unit-distance representations of graphs
- On arrangements of orthogonal circles
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs
- Dot product dimensions of graphs
- Dot product representations of planar graphs
- What graphs are 2-dot product graphs?
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- Conflict-free coloring of intersection graphs
- What Graphs are 2-Dot Product Graphs?
- On Embeddability of Unit Disk Graphs onto Straight Lines
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
- The complexity of drawing a graph in a polygonal region
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Conflict-free coloring of intersection graphs
- Fixed points, Nash equilibria, and the existential theory of the reals
- Global Rigidity of Unit Ball Graphs
- Sphere and dot product representations of graphs
- On the complexity of some geometric problems with fixed parameters
- Computing a maximum clique in geometric superclasses of disk graphs
- Balanced line separators of unit disk graphs
- On embeddability of unit disk graphs onto straight lines
- Intersection graphs of non-crossing paths
- Establishing herd immunity is hard even in simple geometric networks
- The Complexity of Drawing Graphs on Few Lines and Few Planes
- Spherical graph drawing by multi-dimensional scaling
- On the complexity of recognizing nerves of convex sets
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- Logical labeling schemes
- Dot product representations of planar graphs
- The complexity of recognizing geometric hypergraphs
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
- Moduli spaces of geometric graphs
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- On the complexity of target set selection in simple geometric networks
- Dot product dimension of unicyclic graphs
- A classification of disconnected graphs with exactly one cycle by their dot product dimension
- Randomized communication and implicit graph representations
- Realizability of free spaces of curves
- An efficient algorithm to compute dot product dimension of some outerplanar graphs
- Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete
- The complexity of recognizing geometric hypergraphs
- Realizability of free spaces of curves
- What relations are reliably embeddable in Euclidean space?
- Subexponential algorithms for clique cover on unit disk and unit ball graphs
This page was built for publication: Sphere and dot product representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411410)
