Pages that link to "Item:Q3694710"
From MaRDI portal
The following pages link to An Efficient Parallel Biconnectivity Algorithm (Q3694710):
Displaying 50 items.
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks (Q666219) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- An optimal parallel connectivity algorithm (Q797997) (← links)
- Finding Euler tours in parallel (Q801686) (← links)
- Improved algorithms for graph four-connectivity (Q808289) (← links)
- Deterministic parallel list ranking (Q808699) (← links)
- Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- A simple randomized parallel algorithm for list-ranking (Q911268) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Successive approximation in parallel graph algorithms (Q914386) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- On efficient parallel strong orientation (Q1082819) (← links)
- Prallel algorithms for analyzing activity networks (Q1090459) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- On the complexity of parallel parsing of general context-free languages (Q1095675) (← links)
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Parallel computational geometry (Q1115600) (← links)
- An optimal parallel algorithm for the minimum circle-cover problem (Q1123605) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
- Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
- A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- A new graph triconnectivity algorithm and its parallelization (Q1193533) (← links)
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs (Q1198065) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
