BOUNDARY-OPTIMAL TRIANGULATION FLOODING

DOI10.1142/S0218195906002038MaRDI QIDQ5470177zbMATH OpenFDO

Authors Norbert Zeh, R. J. Nowakowski

Publication date 29 May 2006

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195906002038

zbMATH Keywords

algorithmcolouringcomputational geometrycomputer graphicsgraph layoutplanar triangulationseparatorstriangulation flooding problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms and Computation
• 3-colored triangulation of 2D maps
• Load balancing by graph coloring, an algorithm
• Economic 3-colored subdivision of triangulations
• Flooding edge weighted graphs

Cites work

• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• A Separator Theorem for Planar Graphs
• Eavesdropping games
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Finding small simple cycle separators for 2-connected planar graphs
• The complexity of searching a graph

Cited in

(4)

• Algorithms and Computation
• Connected graph searching
• Connected searching of weighted trees
• An annotated bibliography on guaranteed graph searching

This page was built for publication: BOUNDARY-OPTIMAL TRIANGULATION FLOODING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470177)