New sparseness results on graph spanners (1992)
- Authors:
- Autor USP: SOARES, JOSE AUGUSTO RAMOS - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Publisher: University of Chicago
- Publisher place: Chicago
- Date published: 1992
-
ABNT
CHANDRA, B et al. New sparseness results on graph spanners. . Chicago: University of Chicago. . Acesso em: 24 abr. 2024. , 1992 -
APA
Chandra, B., Das, D., Narasimhan, G., & Soares, J. A. R. (1992). New sparseness results on graph spanners. Chicago: University of Chicago. -
NLM
Chandra B, Das D, Narasimhan G, Soares JAR. New sparseness results on graph spanners. 1992 ;[citado 2024 abr. 24 ] -
Vancouver
Chandra B, Das D, Narasimhan G, Soares JAR. New sparseness results on graph spanners. 1992 ;[citado 2024 abr. 24 ] - Maximum diameter of regular digraphs
- Algorithms for maximum independent set in convex bipartite graphs
- Approximating euclidean distances by small degree graphs
- Maximum diameter of regular digraphs
- Circuitos disjuntos em grafos
- Approximating Euclidean distances by small degree graphs
- Algorithms for terminal Steiner trees
- Compressão de dados e de imagens
- Improved bound for the Caratheodory rank of the bases of a matroid
- Algorithms for terminal Steiner trees
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
