Mutual witness Gabriel drawings of complete bipartite graphs
From MaRDI portal
Publication:6117033
DOI10.1007/978-3-031-22203-0_3arXiv2209.01004MaRDI QIDQ6117033
Giuseppe Liotta, William J. Lenhart
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.01004
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Witness Gabriel graphs
- Lower bounds on the obstacle number of graphs
- Witness (Delaunay) graphs
- On the structure of graphs with low obstacle number
- Witness rectangle graphs
- Obstacle numbers of graphs
- The relative neighborhood graph for mixed feature variables
- Drawing graphs using a small number of obstacles
- Mutual witness proximity graphs
- On obstacle numbers
- Obstructing Visibilities with One Obstacle
- Graphs with Large Obstacle Numbers
- Simultaneous Embedding
- Shape-Based Quality Metrics for Large Graph Visualization
- Mutual witness Gabriel drawings of complete bipartite graphs
- Outside-obstacle representations with all vertices on the outer face
- Unnamed Item
- Unnamed Item
This page was built for publication: Mutual witness Gabriel drawings of complete bipartite graphs