Parallel algorithms for cographs and parity graphs with applications
From MaRDI portal
Publication:3495663
Recommendations
Cited in
(15)- A theorem on permutation graphs with applications
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- An NC algorithm for the clique cover problem in cocomparability graphs and its application
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
- A faster parallel connectivity algorithm on cographs
- Efficient parallel recognition of cographs
- Recognizing cographs and threshold graphs through a classification of their edges
- scientific article; zbMATH DE number 6708339 (Why is no real title available?)
- Parallel algorithms for parity graphs
- scientific article; zbMATH DE number 140480 (Why is no real title available?)
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- scientific article; zbMATH DE number 4115994 (Why is no real title available?)
- Parallel algorithms for P4-comparability graphs
- Parallel algorithm for cograph recognition with applications
- On parallel recognition of cographs
This page was built for publication: Parallel algorithms for cographs and parity graphs with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495663)