On the graph traversal method for evaluating linear binary-chain programs (Q5926750): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the bottom-up evaluation of recursive queries
@@ Property / cites work: On the bottom-up evaluation of recursive queries / rank @@
+Normal rank
@@ Property / cites work @@
+Q3125846
@@ Property / cites work: Q3125846 / rank @@
+Normal rank
@@ Property / cites work @@
+On compiling queries in recursive first-order databases
+Normal rank
@@ Property / cites work @@
+Graphic representation of linear recursive rules
@@ Property / cites work: Graphic representation of linear recursive rules / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of magic
@@ Property / cites work: On the power of magic / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient evaluation for a subset of recursive queries
+Normal rank
@@ Property / cites work @@
+Q3992908
@@ Property / cites work: Q3992908 / rank @@
+Normal rank
@@ Property / cites work @@
+Abstract interpretation based on oldt resolution
@@ Property / cites work: Abstract interpretation based on oldt resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding all feedback vertices
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02916768
+Normal rank
@@ Property / OpenAlex ID @@
+W1983725450
@@ Property / OpenAlex ID: W1983725450 / rank @@
+Normal rank