Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Approximation and intractability results for the maximum cut problem and its variantsHaglin, D.J. ; Venkatesan, S.M.IEEE transactions on computers, 1991-01, Vol.40 (1), p.110-113 [Periódico revisado por pares]New York, NY: IEEETexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
A new approach for the domination problem on permutation graphsLiang, Y. ; Rhee, C. ; Dhall, S.K. ; Lakshmivarahan, S.Information processing letters, 1991-02, Vol.37 (4), p.219-224 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Computing a maximum cardinality matching in a bipartite graph in time O( n1.5[formula omitted])Alt, H. ; Blum, N. ; Mehlhorn, K. ; Paul, M.Information processing letters, 1991-02, Vol.37 (4), p.237-240 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
On approximating the minimum independent dominating setIrving, Robert W.Information processing letters, 1991-02, Vol.37 (4), p.197-200 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Computer based proofs by induction in graph theory: a house of cards?: Graph theoretic models in computer science IIBAREFOOT, C. A ; ENTRINGER, R. C ; MULLHAUPT, A. PMathematical and computer modelling, 1993, Vol.17 (11), p.17-23 [Periódico revisado por pares]Oxford: Elsevier ScienceTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Broadcasting and gossiping in de Bruijn networksBERMOND, J.-C ; FRAIGNIAUD, PSIAM journal on computing, 1994-02, Vol.23 (1), p.212-225 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Unique binary-search-tree representations and equality testing of sets and sequencesRAJAMANI SUNDAR ; TARJAN, R. ESIAM journal on computing, 1994-02, Vol.23 (1), p.24-44 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Generating linear extensions fastPRUESSE, G ; RUSKEY, FSIAM journal on computing, 1994-04, Vol.23 (2), p.373-386 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Trading space for time in undirected s-t connectivityBRODER, A. Z ; KARLIN, A. R ; PRABHAKAR RAGHAVAN ; UPFAL, ESIAM journal on computing, 1994-04, Vol.23 (2), p.324-334 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Some results on elusive graph propertiesTRIESCH, ESIAM journal on computing, 1994-04, Vol.23 (2), p.247-254 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |