Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
An efficient algorithm for the 8.8`Optimal stable marriageIRVING, R. W ; LEATHER, P ; GUSFIELD, DJournal of the ACM, 1987, Vol.34 (3), p.532-543 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Recognizing planar perfect graphsHsu, Wen-LianJournal of the ACM, 1987-04, Vol.34 (2), p.255-288 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
3 |
Material Type: Ata de Congresso
|
![]() |
An O(n3log n) deterministic and an O(n3) Las Vegas isomorphism test for trivalent graphsGALIL, Z ; HOFFMANN, C. M ; LUKS, E. M ; SCHNORR, C. P ; WEBER, AJournal of the Association for Computing Machinery, 1987, Vol.34 (3), p.513-531 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Hierarchical planitary testing algorithmsLENGAUER, TJournal of the ACM, 1989, Vol.36 (3), p.474-509 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Optimum lopsided binary treesKAPOOR, S ; REINGOLD, E. MJournal of the ACM, 1989-07, Vol.36 (3), p.573-590 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
A graph partitioning algorithm by node separatorsLIU, J. W. HACM transactions on mathematical software, 1989-09, Vol.15 (3), p.198-219 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Modularity of cycles and paths in graphsARKIN, E. M ; PAPADIMITIOU, C. H ; YANNAKAKIS, MJournal of the ACM, 1991-04, Vol.38 (2), p.255-274 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Faster scaling algorithms for general graph-matching problemsGABOW, H. N ; TARJAN, R. EJournal of the ACM, 1991-10, Vol.38 (4), p.815-853 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Efficient decision procedures for graph properties on context-free graph languagesLENGAUER, T ; WANKE, EJournal of the ACM, 1993-04, Vol.40 (2), p.368-393 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingGOEMANS, M. X ; WILLIAMSON, D. PJournal of the ACM, 1995-11, Vol.42 (6), p.1115-1145 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |