Parameters of Bar k-Visibility Graphs
From MaRDI portal
Publication:5301426
DOI10.7155/JGAA.00157zbMATH Open1161.68666OpenAlexW2117587224MaRDI QIDQ5301426FDOQ5301426
Authors: Stefan Felsner, Mareike Massow
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55413
Recommendations
Cited In (17)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Bar k-Visibility Graphs
- Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
- Simultaneous visibility representations of undirected pairs of graphs
- Visibility representations of boxes in 2.5 dimensions
- Graph Drawing
- On \(k\)-visibility graphs
- Characterization of \([1,k]\)-bar visibility trees
- Coloring non-crossing strings
- Bar 1-visibility graphs and their relation to other nearly planar graphs
- Further Results on Bar k-Visibility Graphs
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
- Thickness of Bar 1-Visibility Graphs
- Coverage with \(k\)-transmitters in the presence of obstacles
- On Aligned Bar 1-Visibility Graphs
- Colored anchored visibility representations in 2D and 3D space
This page was built for publication: Parameters of Bar k-Visibility Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301426)