Inproceedings,

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.

, , , , , , , and .
LATIN, volume 10807 of Lecture Notes in Computer Science, page 1-13. Springer, (2018)

Meta data

Tags

Users

  • @dblp

Comments and Reviews