Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo de Congresso
|
![]() |
A better approximation ratio for the minimum k-edge-connected spanning subgraph problemCristina Gomes Fernandes 1966- ACM-SIAM symposium on Discrete algorithms - SODA (8. 1997 New Orleans)Proceedings New York: ACM, 1997New York ACM 1997Acesso online. A biblioteca também possui exemplares impressos. |
2 |
Material Type: Artigo de Congresso
|
![]() |
An optimal algorithm for checking regularity (extended abstract)Yoshiharu Kohayakawa Vojtěch Rödl; Luboš Thoma; ACM-SIAM Symposium on Discrete Algorithms - SODA (13. 2002 San Francisco, California)Proceedings Philadelphia : SIAM, 2002Philadelphia SIAM 2002Acesso online. A biblioteca também possui exemplares impressos. |