Daniela Maftuleac
YOU?
Author Swipe
View article: Lower Bounds for Graph Exploration Using Local Policies
Lower Bounds for Graph Exploration Using Local Policies Open
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as the abstraction of a geometric exploration of a space by a …
View article: Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Recognition of Triangulation Duals of Simple Polygons With and Without Holes Open
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to …
View article: Recognition of Triangulation Duals of Simple Polygons With and Without\n Holes
Recognition of Triangulation Duals of Simple Polygons With and Without\n Holes Open
We investigate the problem of determining if a given graph corresponds to the\ndual of a triangulation of a simple polygon. This is a graph recognition\nproblem, where in our particular case we wish to recognize a graph which\ncorresponds …