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

Alexandre Santiago de Abreu et al. (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-77404-6_1

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/AbreuCFFKMPP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/AbreuCFFKMPP18
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. LATIN 2018: 1-13

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.