Author:
Cáceres E. N.,Song S. W.,Szwarcfiter J. L.
Subject
Computer Science Applications,General Mathematics,Software
Reference34 articles.
1. C.E.R. Alves, E.N. Cáceres, A.A. Castro Jr, S.W. Song and J.L. Szwarcfiter, Efficient Parallel Implementation of Transitive Closure of Digraphs, in10th European PVM/MPI Users' Group Conference. Edited by J. Dongarra, D. Laforenza and S. Orlando, Springer Verlag, Berlin (2003) 126–133.
2. R. Anderson and E. Mayr,Parallelism and Greedy Algorithms.Technical Report STAN-CS-84-1003, Computer Science Department, Stanford University Bonn (1984).
3. Reducing prime graphs and recognizing circle graphs
4. E.N. Cáceres, S.W. Song and J.L. Szwarcfiter, A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs, inProc. The 2001 International Conference on Computational Science. Springer Verlag, Berlin (2001) 638–647.
5. E.N. Cáceres, S.W. Song and J.L. Szwarcfiter, A Parallel Unrestricted Depth Search Algorithm, inProc. 2001 International Conference on Parallel and Distributed Processing Techniques and Applications(2001) 521–526.