BOUNDARY-OPTIMAL TRIANGULATION FLOODING
From MaRDI portal
Publication:5470177
DOI10.1142/S0218195906002038zbMath1096.65021MaRDI QIDQ5470177
Norbert Zeh, Richard J. Nowakowski
Publication date: 29 May 2006
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
algorithmcolouringcomputer graphicscomputational geometryplanar triangulationseparatorsgraph layouttriangulation flooding problem
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
An annotated bibliography on guaranteed graph searching, Connected graph searching, Connected searching of weighted trees
Cites Work
- Finding small simple cycle separators for 2-connected planar graphs
- The complexity of searching a graph
- A Separator Theorem for Planar Graphs
- Edge Separators of Planar and Outerplanar Graphs With Applications
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Eavesdropping games