Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2010.03.015
@@ Property / DOI: 10.1016/j.ipl.2010.03.015 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2070696911
@@ Property / OpenAlex ID: W2070696911 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58172968
@@ Property / Wikidata QID: Q58172968 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3639634
@@ Property / cites work: Q3639634 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster algorithm for betweenness centrality*
@@ Property / cites work: A faster algorithm for betweenness centrality* / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
+Normal rank
@@ Property / cites work @@
+Q4448751
@@ Property / cites work: Q4448751 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding biconnected components in O(n) time for a class of graphs
+Normal rank
@@ Property / cites work @@
+Q3138973
@@ Property / cites work: Q3138973 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2010.03.015
@@ Property / DOI: 10.1016/J.IPL.2010.03.015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:763538