Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
type: Item
instance of: scholarly article
title: Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
zbMATH Open document ID: 0992.68233
author: Pilar de la Torre
author: Clyde Kruskal
published in: Theory of Computing Systems
publication date: 2001-11-21T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1676032
zbMATH Keywords: NC-algorithms
zbMATH Keywords: lexicographic search problems
zbMATH Keywords: reducible flow graphs
MaRDI profile type: Publication
full work available at URL: s00224-001-1008-4
OpenAlex ID: W2031313188
DOI: 10.1007/S00224-001-1008-4
description: scientific article; zbMATH DE number 1676032