Simple realizability of complete abstract topological graphs in P
From MaRDI portal
Publication:633211
Recommendations
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- Simple realizability of complete abstract topological graphs simplified
- Simple realizability of complete abstract topological graphs simplified
- scientific article; zbMATH DE number 7030516
- Enumeration of simple complete topological graphs
Cites work
- scientific article; zbMATH DE number 4013540 (Why is no real title available?)
- scientific article; zbMATH DE number 434700 (Why is no real title available?)
- scientific article; zbMATH DE number 4142090 (Why is no real title available?)
- scientific article; zbMATH DE number 4082515 (Why is no real title available?)
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 17663 (Why is no real title available?)
- scientific article; zbMATH DE number 2079388 (Why is no real title available?)
- A special planar satisfiability problem and a consequence of its NP- completeness
- Algorithms for Jordan curves on compact surfaces
- Complexity of some geometric and topological problems
- Decidability of string graphs
- Enumeration of simple complete topological graphs
- Graph-Theoretic Concepts in Computer Science
- How many ways can one draw a graph?
- Intersection graphs of segments
- Intersections of curves on surfaces
- Noncrossing Subgraphs in Topological Layouts
- On complexity of the word problem in braid groups and mapping class groups
- On edges crossing few other edges in simple topological complete graphs
- On the crossing number of complete graphs
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Recognizing string graphs in NP
- Recognizing string graphs is decidable
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- Simultaneous Graph Embeddings with Fixed Edges
- String graphs requiring exponential representations
- String graphs. II: Recognizing string graphs is NP-hard
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- Unavoidable configurations in complete topological graphs
Cited in
(22)- On plane subgraphs of complete topological drawings
- Bad drawings of small complete graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- The Complexity of Angular Resolution
- Empty triangles in good drawings of the complete graph
- An optimal algorithm for reconstructing point set order types from radial orderings
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs
- Simple realizability of complete abstract topological graphs simplified
- On rectilinear topological graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- Different types of isomorphisms of drawings of complete multipartite graphs
- Complete graph drawings up to triangle mutations
- Improved enumeration of simple topological graphs
- Topological Drawings of Complete Bipartite Graphs
- On the complexity of some geometric problems with fixed parameters
- Simple realizability of complete abstract topological graphs simplified
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- Rotation systems and simple drawings in surfaces
- Fixed points, Nash equilibria, and the existential theory of the reals
- Polyline drawings with topological constraints
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Recognition and complexity of point visibility graphs
This page was built for publication: Simple realizability of complete abstract topological graphs in P
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633211)
