scientific article; zbMATH DE number 3930349
From MaRDI portal
Publication:3703296
zbMATH Open0581.68041MaRDI QIDQ3703296FDOQ3703296
Authors: Jana Kršňáková, Václav Koubek 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- Parallel algorithms for finding connected components of a graph
- scientific article; zbMATH DE number 1057772
- Parallel algorithms for connectivity problems in graph theory
- scientific article; zbMATH DE number 3905859
- A Simpler Parallel Algorithm for Graph Connectivity
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
- scientific article; zbMATH DE number 3972201
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Efficient parallel algorithms for graph problems
- Parallel algorithms for connectivity problems on interval graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cited In (29)
- Parallel algorithms for connectivity problems in graph theory
- An Efficient Parallel Biconnectivity Algorithm
- Approximating unweighted connectivity problems in parallel
- A linear systolic algorithm for the connected component problem
- Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
- Equivalence in the complexity of several problems
- Parallel Complexity of the Connected Subgraph Problem
- Determining connected components in linear time by a linear number of processors
- A faster parallel algorithm for \(k\)-connectivity
- Connected components and minimum paths
- Parallel algorithms for series parallel graphs
- Parallel computations on a graph
- Optimal parallel algorithms on planar graphs
- An optimal parallel connectivity algorithm
- Title not available (Why is that?)
- Solving Undirected Graph Problems on VLSI
- Title not available (Why is that?)
- An efficient and fast parallel-connected component algorithm
- Parallel algorithms for finding connected components of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Science - ICCS 2004
- A faster parallel connectivity algorithm on cographs
- Parallel algorithms for P4-comparability graphs
- Graph Problems on a Mesh-Connected Processor Array
- An optimal parallel co-connectivity algorithm
- PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations
- Title not available (Why is that?)
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 Q3703296)
