scientific article; zbMATH DE number 3576688

MaRDI QIDQ4146249zbMATH OpenFDO

Authors Daniel S. Hirschberg

Publication date 1976

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(10)

• Determining connected components in linear time by a linear number of processors
• Near-optimal scheduling in the congested clique
• Parallelism and the feedback vertex set problem
• An optimal parallel connectivity algorithm
• Parallel computation and conflicts in memory access
• On the parallel computation of the biconnected and strongly connected co-components of graphs
• Parallel strong orientation of an undirected graph
• On the Strongly Connected and Biconnected Components of the Complement of Graphs
• Efficient parallel algorithms for path problems in directed graphs
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146249)