A faster parallel connectivity algorithm on cographs
From MaRDI portal
Publication:2371145
DOI10.1016/j.aml.2006.05.003zbMath1123.05055MaRDI QIDQ2371145
Publication date: 29 June 2007
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2006.05.003
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel recognition of complement reducible graphs and cotree construction
- Complement reducible graphs
- An optimal parallel algorithm for node ranking of cographs
- An optimal parallel matching algorithm for cographs
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
- An optimal path cover algorithm for cographs
- Parallel Algorithm for Cograph Recognition with Applications
- Parallel algorithms for cographs and parity graphs with applications
- A Linear Recognition Algorithm for Cographs
- Dacey Graphs
- Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
- A simple parallel tree contraction algorithm
- Finding Connected Components in O(log n log log n) Time on the EREW PRAM
