On parallel recognition of cographs
From MaRDI portal
Publication:627166
DOI10.1016/J.TCS.2010.11.003zbMATH Open1211.68502OpenAlexW1983650378MaRDI QIDQ627166FDOQ627166
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.003
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Complement reducible graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Parallel algorithms for cographs and parity graphs with applications
- A Linear Recognition Algorithm for Cographs
- Dacey Graphs
- An optimal parallel algorithm for node ranking of cographs
- An optimal parallel co-connectivity algorithm
- Efficient parallel recognition of cographs
- Parallel Algorithm for Cograph Recognition with Applications
- A simple parallel tree contraction algorithm
- Title not available (Why is that?)
- Parallel recognition of complement reducible graphs and cotree construction
Cited In (5)
Recommendations
This page was built for publication: On parallel recognition of cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627166)
