Independent dominating sets in planar triangulations (2023)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.5817/CZ.MUNI.EUROCOMB23-023
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Charles University
- Publisher place: Prague
- Date published: 2023
- Source:
- Título: Proceedings
- Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. 2023, Anais.. Prague: Charles University, 2023. Disponível em: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023. Acesso em: 11 fev. 2026. -
APA
Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2023). Independent dominating sets in planar triangulations. In Proceedings. Prague: Charles University. doi:10.5817/CZ.MUNI.EUROCOMB23-023 -
NLM
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2026 fev. 11 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023 -
Vancouver
Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2026 fev. 11 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- Problemas circulatorios em grafos
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
Informações sobre o DOI: 10.5817/CZ.MUNI.EUROCOMB23-023 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3167752.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
