Efficient parallel algorithms for series parallel graphs
From MaRDI portal
Recommendations
Cited in
(16)- A compact labelling scheme for series-parallel graphs
- Deciding whether graph \(G\) has page number one is in NC
- Parallel recognition of series-parallel graphs
- Efficient parallel algorithms for graph problems
- Efficiently parallelizable problems on a class of decomposable graphs
- An optimal parallel algorithm for planar cycle separators
- scientific article; zbMATH DE number 3972201 (Why is no real title available?)
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- scientific article; zbMATH DE number 4066948 (Why is no real title available?)
- scientific article; zbMATH DE number 139775 (Why is no real title available?)
- scientific article; zbMATH DE number 637289 (Why is no real title available?)
- scientific article; zbMATH DE number 1472126 (Why is no real title available?)
- Parallel algorithms for series parallel graphs
- Improved parallel depth-first search in undirected planar graphs
- Series-Parallel Operations with Alpha-Graphs
- Parallel algorithms for series parallel graphs and graphs with treewidth two
This page was built for publication: Efficient parallel algorithms for series parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348421)