COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
From MaRDI portal
Publication:4848834
Recommendations
- Computational complexity aspects of point visibility graphs
- Some results on visibility graphs
- A general notion of visibility graphs
- On the connectivity of visibility graphs
- Recognition and Complexity of Point Visibility Graphs
- Recognition and complexity of point visibility graphs
- A note on visibility graphs
- Variety of mutual-visibility problems in graphs
- On \(k\)-visibility graphs
- scientific article; zbMATH DE number 841640
Cited in
(14)- On colourability of polygon visibility graphs
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Visibility number of directed graphs
- Efficient visibility algorithm for high-frequency time-series: application to fault diagnosis with graph convolutional network
- A note on visibility graphs
- On colourability of polygon visibility graphs
- On-line convex planarity testing
- Computing the maximum clique in the visibility graph of a simple polygon
- A visibility graph averaging aggregation operator
- Incremental convex planarity testing
- Recognition and complexity of point visibility graphs
- Recognition and Complexity of Point Visibility Graphs
- Visibility graphs of towers
- Variants of Visibility and their Complexity
This page was built for publication: COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848834)