Multilength single pair shortest disjoint paths (2004)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; PINA JUNIOR, JOSE COELHO DE - IME
- Unidade: IME
- Assunto: COMPUTABILIDADE E COMPLEXIDADE
- Language: Inglês
- Imprenta:
-
ABNT
FERNANDES, Cristina Gomes e VAN DER HOLST, Hendricus e PINA JÚNIOR, José Coelho de. Multilength single pair shortest disjoint paths. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdf. Acesso em: 18 set. 2024. , 2004 -
APA
Fernandes, C. G., Van der Holst, H., & Pina Júnior, J. C. de. (2004). Multilength single pair shortest disjoint paths. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdf -
NLM
Fernandes CG, Van der Holst H, Pina Júnior JC de. Multilength single pair shortest disjoint paths [Internet]. 2004 ;[citado 2024 set. 18 ] Available from: https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdf -
Vancouver
Fernandes CG, Van der Holst H, Pina Júnior JC de. Multilength single pair shortest disjoint paths [Internet]. 2004 ;[citado 2024 set. 18 ] Available from: https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdf - Lempel, Even, and Cederbaum planarity method
- Spanning trees with nonseparating paths
- Counting Hamiltonian cycles in the matroid basis graph
- Period collapse in Ehrhart quasi-polynomials of {1, 3}-graphs
- Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon
- Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
- A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem
- Estrutura grafica de matrizes
- Length-bounded disjoint paths in planar graphs
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
1372356.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas