Idioma:

Finding euler circuits in logarithmic parallel time

Awerbuch, B. ; Israeli, A. ; Shiloach, Y.

Annual ACM Symposium on Theory of Computing: Proceedings of the sixteenth annual ACM symposium on Theory of computing, 1984, p.249-257 [Periódico revisado por pares]

New York, NY, USA: ACM

Texto completo disponível

Citações Citado por

Enviar para

Título:
Finding euler circuits in logarithmic parallel time
Autor: Awerbuch, B. ; Israeli, A. ; Shiloach, Y.
Assuntos: Computing methodologies -- Parallel computing methodologies -- Parallel algorithms ; Mathematics of computing -- Discrete mathematics -- Graph theory -- Paths and connectivity problems ; Theory of computation -- Design and analysis of algorithms -- Parallel algorithms ; Theory of computation -- Models of computation -- Computability -- Turing machines
É parte de: Annual ACM Symposium on Theory of Computing: Proceedings of the sixteenth annual ACM symposium on Theory of computing, 1984, p.249-257
Notas: SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
Descrição: A parallel algorithm for finding Euler circuits in graphs is presented. Its depth is log |E| and it employs |E| processors. The computational model considered is the PRAM (the shared memory model). This algorithm is a nice example of utilizing another parallel algorithm that does not seem to be closely related to our problem, namely the algorithm for finding the connected components and a spanning forest of an undirected graph.
Editor: New York, NY, USA: ACM
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 7 Avançar Ir para próxima página

Realização: Logos de Redes Sociais:

Finding euler circuits in logarithmic parallel time

Awerbuch, B. ; Israeli, A. ; Shiloach, Y.

New York, NY, USA: ACM

Buscando em bases de dados remotas. Favor aguardar.