Clique-width of point configurations
From MaRDI portal
Recommendations
- Clique-width of point configurations
- Clique-width of path powers
- Upper bounds to the clique width of graphs
- Clique-width and edge contraction
- Clique cover width and clique sum
- The relative clique-width of a graph
- On the clique cover width problem
- Clique-width for graph classes closed under complementation
- scientific article; zbMATH DE number 7204407
- Bounding clique-width via perfect graphs
Cites work
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 177438 (Why is no real title available?)
- Abstract order type extension and new results on the rectilinear crossing number
- An optimal algorithm for reconstructing point set order types from radial orderings
- Approximating clique-width and branch-width
- Area-optimal simple polygonalizations: the CG challenge 2019
- Complexity of some geometric and topological problems
- Computational complexity of art gallery problems
- Computations by fly-automata beyond monadic second-order logic
- Decomposing a Polygon into Simpler Components
- Enumerating order types for small point sets with applications
- Exact algorithms for terrain guarding
- Finding Branch-Decompositions and Rank-Decompositions
- Finding points in general position
- Graph minors. II. Algorithmic aspects of tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hitting and Piercing Rectangles Induced by a Point Set
- Limits of order types
- Linear time solvable optimization problems on graphs of bounded clique-width
- Minimal representations of order types by geometric graphs
- Multidimensional Sorting
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- On recognizing and characterizing visibility graphs of simple polygons
- Orthogonal terrain guarding is NP-complete
- Parameter analysis for guarding terrains
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Point visibility graph recognition is NP-hard
- Recognizability, hypergraph operations, and logical types
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- Terrain guarding is NP-hard
- The Complexity of Order Type Isomorphism
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tree-Related Widths of Graphs and Hypergraphs
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
This page was built for publication: Clique-width of point configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918571)
