On the vector representation of the reachability in planar directed graphs (Q1215513): Difference between revisions

@@ Property / Wikidata QID @@
+Q29013644
@@ Property / Wikidata QID: Q29013644 / rank @@
+Normal rank
@@ 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.1016/0020-0190(75)90019-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2031251427
@@ Property / OpenAlex ID: W2031251427 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems and Procedures for Loop-Free Routing in Directed Communication Networks
+Normal rank
@@ Property / cites work @@
+Efficient determination of the transitive closure of a directed graph
+Normal rank
@@ Property / cites work @@
+A transitive closure algorithm
@@ Property / cites work: A transitive closure algorithm / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:1215513