Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
The complexity of searching a graph
Journal of the ACM (JACM)
Edge separators of planar and outerplanar graphs with applications
Journal of Algorithms
Time/space tradeoffs for polygon mesh rendering
ACM Transactions on Graphics (TOG)
SIAM Journal on Computing
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
Intrusion detection using autonomous agents
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on recent advances in intrusion detection systems
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Minimizing Width in Linear Layouts
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Polyhedral Approach to Planar Augmentation and Related Problems
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
| Hi-index | 0.00 |
Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces as well as the number of connected black and white regions are small at all times We call such a colouring sequence of the triangles a flooding Our main result shows that it is in general impossible to guarantee boundary size ${\mathcal O}(n^{1-\epsilon})$, for any ε0, and a number of regions that is o(log n), where n is the number of faces of the triangulation We also show that a flooding with boundary size ${\mathcal O}(\sqrt{n})$ and ${\mathcal O}({\rm log}n)$ regions can be computed in ${\mathcal O}({\it n} {\rm log}n)$ time.