An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing (2006)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: SIAM
- Publisher place: Philadelphia
- Date published: 2006
- Source:
- Título: Proceedings
- Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA
-
ABNT
DELLAMONICA JUNIOR, Domingos e KOHAYAKAWA, Yoshiharu. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. 2006, Anais.. Philadelphia: SIAM, 2006. Disponível em: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672. Acesso em: 27 fev. 2026. -
APA
Dellamonica Junior, D., & Kohayakawa, Y. (2006). An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672 -
NLM
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2026 fev. 27 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672 -
Vancouver
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing [Internet]. Proceedings. 2006 ;[citado 2026 fev. 27 ] Available from: https://dl-acm-org.ez67.periodicos.capes.gov.br/citation.cfm?doid=1109557.1109672 - Weak hypergraph regularity and linear hypergraphs
- Property testing and parameter testing for permutations
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
- Turán's extremal problem in random graphs: forbidding even cycles
- Special issue on Ramsey theory. [Editorial]
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
