An Efficient Parallel Biconnectivity Algorithm
From MaRDI portal
Recommendations
- Approximating biconnectivity in parallel
- An optimal parallel connectivity algorithm
- Towards more precise parallel biconnectivity approximation
- An efficient and fast parallel-connected component algorithm
- An optimal parallel co-connectivity algorithm
- scientific article; zbMATH DE number 3930349
- Parallel algorithms for connectivity problems in graph theory
- Efficient parallel algorithms for doubly convex-bipartite graphs
- A Simpler Parallel Algorithm for Graph Connectivity
- scientific article; zbMATH DE number 1057772
Cited in
(only showing first 100 items - show all)- Optimally edge-colouring outerplanar graphs is in NC
- Parallel construction of minimal suffix and factor automata
- Successive approximation in parallel graph algorithms
- Subtree isomorphism is in random NC
- Parallel rectilinear shortest paths with rectangular obstacles
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
- Successive approximation in parallel graph algorithms (extended abstract)
- Polylogarithmic time algorithms for shortest path forests in programmable matter
- A new graph triconnectivity algorithm and its parallelization
- A parallel algorithm for finding a triconnected component separator with an application
- Planarity testing in parallel
- Prallel algorithms for analyzing activity networks
- Efficient list ranking on the reconfigurable mesh, with applications
- On efficient parallel strong orientation
- Optimal parallel algorithms for rectilinear link-distance problems
- Partitioning into degenerate graphs in linear time
- scientific article; zbMATH DE number 4060743 (Why is no real title available?)
- The parallel complexity of tree embedding problems (extended abstract)
- Scalability and communication in parallel low-complexity lossless compression
- scientific article; zbMATH DE number 7566062 (Why is no real title available?)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
- Tight complexity bounds for term matching problems
- The parallel solution of domination problems on chordal and strongly chordal graphs
- scientific article; zbMATH DE number 7561507 (Why is no real title available?)
- Optimal computation of shortest paths on doubly convex bipartite graphs
- Parallelism and dictionary based data compression
- Why should biconnected components be identified first
- Solving some combinatorial problems on arrays with one-way dataflow
- Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality
- On testing consecutive-ones property in parallel
- Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Priority functions for the approximation of the metric TSP
- A remark on maximum matching of line graphs
- Solving NP-hard problems in 'almost trees': vertex cover
- Deterministic parallel list ranking
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
- Optimal parallel algorithms for path problems on planar graphs
- More general parallel tree contraction: register allocation and broadcasting in a tree
- Parallel algorithms for all minimum link paths and link center problems
- Parallel preprocessing for path queries without concurrent reading.
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- Efficient parallel term matching and anti-unification
- Finding Triconnected Components by Local Replacement
- An optimal parallel algorithm for digital curve segmentation
- Smallest bipartite bridge-connectivity augmentation
- Parallel computational geometry
- Finding fundamental cycles and bridges on a tree-structured parallel computer
- Computing Prüfer codes efficiently in parallel
- Computing the all-pairs longest chains in the plane
- A time-optimal solution for the path cover problem on cographs.
- Optimal parallel colouring algorithms for totally decomposable graphs
- An optimal parallel algorithm for the minimum circle-cover problem
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Efficient parallel algorithms for r-dominating set and p-center problems on trees
- The parallel complexity of elimination ordering procedures
- Improved algorithms for graph four-connectivity
- Data-oblivious graph algorithms in outsourced external memory
- A unified approach to parallel depth-first traversals of general trees
- Optimal parallel algorithms for forest and term matching
- A parallel algorithm for bisection width in trees
- Parallel algorithms for shortest path problems in polygons
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
- An optimal parallel algorithm for computing furthest neighbors in a tree
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- Parallel methods for visibility and shortest-path problems in simple polygons
- A parallel algorithm for finding a blocking flow in an acyclic network
- A simple randomized parallel algorithm for list-ranking
- The bridge-connectivity augmentation problem with a partition constraint
- Planar orientations with low out-degree and compaction of adjacency matrices
- An efficient distributed bridge-finding algorithm
- More general parallel tree contraction: Register allocation and broadcasting in a tree
- O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
- Maintaining bridge-connected and biconnected components on-line
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Improving the efficiency of parallel minimum spanning tree algorithms
- Fully dynamic 2-edge-connectivity in planar graphs
- Parallel construction and query of index data structures for pattern matching on square matrices
- Optimal parallel algorithms on planar graphs
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- The monotone circuit value problem with bounded genus is in NC
- Two faces of greedy leaf removal procedure on graphs
- AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- An optimal parallel connectivity algorithm
- Sweep methods for parallel computational geometry
- An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
- Optimal parallel algorithms on circular-arc graphs
- scientific article; zbMATH DE number 4155927 (Why is no real title available?)
- Optimal parallel algorithms for multiple updates of minimum spanning trees
- Multi-layer bundling as a new approach for determining multi-scale correlations within a high-dimensional dataset
- A 2-approximation NC algorithm for connected vertex cover and tree cover
- DFS tree construction: Algorithms and characterizations
This page was built for publication: An Efficient Parallel Biconnectivity Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694710)
