Pages that link to "Item:Q1112845"
From MaRDI portal
The following pages link to String graphs. II: Recognizing string graphs is NP-hard (Q1112845):
Displayed 18 items.
- Spatial reasoning in a fuzzy region connection calculus (Q835806) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- String graphs requiring exponential representations (Q1121918) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)
- Crossing patterns of segments (Q5953378) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)