Decomposing highly connected graphs into paths on any given length (2019)
- Autor:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Publisher: Impa
- Publisher place: Rio de Janeiro
- Date published: 2019
- Conference titles: Joint Meeting Brazil-France in Mathematics
-
ABNT
WAKABAYASHI, Yoshiko. Decomposing highly connected graphs into paths on any given length. 2019, Anais.. Rio de Janeiro: Impa, 2019. Disponível em: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf. Acesso em: 27 fev. 2026. -
APA
Wakabayashi, Y. (2019). Decomposing highly connected graphs into paths on any given length. In . Rio de Janeiro: Impa. Recuperado de https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf -
NLM
Wakabayashi Y. Decomposing highly connected graphs into paths on any given length [Internet]. 2019 ;[citado 2026 fev. 27 ] Available from: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf -
Vancouver
Wakabayashi Y. Decomposing highly connected graphs into paths on any given length [Internet]. 2019 ;[citado 2026 fev. 27 ] Available from: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf - Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Tree 3-spanners on generalized prisms of graphs
- Quebra-cabecas e plano-decorte
- Approximation and parameterized algorithms for balanced connected partition problems
- Cube packing
- Two- and three-dimensional parametric packing
- On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- Polyhedral and computational results on the k-hop connected dominating set problem
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3004468.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
