An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs (Q4944662): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169908804868
+Normal rank
@@ Property / OpenAlex ID @@
+W2093063644
@@ Property / OpenAlex ID: W2093063644 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4893441
@@ Property / cites work: Q4893441 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
+Normal rank
@@ Property / cites work @@
+Finding biconnected components in O(n) time for a class of graphs
+Normal rank
@@ Property / cites work @@
+An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
+Normal rank
@@ Property / Wikidata QID @@
+Q126245991
@@ Property / Wikidata QID: Q126245991 / rank @@
+Normal rank