Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs

@inproceedings{Biedl2019MaximumMA,
  title={Maximum Matchings and Minimum Blocking Sets in \$\Theta_6\$-Graphs},
  author={Therese C. Biedl and Ahmad Biniaz and Veronika Irvine and Kshitij Jain and Philipp Kindermann and Anna Lubiw},
  year={2019}
}
Θ6-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower bounds on the size of maximum matchings in these graphs. The best known lower bound is n/3, where n is the number of vertices of the graph. Babu et al. (2014) conjectured that any Θ6-graph has a (near-)perfect matching (as is true for standard Delaunay… CONTINUE READING
3
Twitter Mentions

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

Toughness and Delaunay Triangulations

  • Symposium on Computational Geometry
  • 1987
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

The Factorization of Linear Graphs

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

On shape Delaunay tessellations

  • Inf. Process. Lett.
  • 2014
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Approximation algorithms for shortest path motion planning

K. L. Clarkson
  • Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC),
  • 1987
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Approximating the Complete Euclidean Graph

  • SWAT
  • 1988
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Sur le couplage maximum d’un graphe

C. Berge
  • Comptes Rendus de l’Académie des Sciences, Paris,
  • 1958
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…