The directed subgraph homeomorphism problem (Q1132111): 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.1016/0304-3975(80)90009-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2569646339
@@ Property / OpenAlex ID: W2569646339 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624995
@@ Property / cites work: Q5624995 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Flow Graph Reducibility
@@ Property / cites work: Flow Graph Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140366
@@ Property / cites work: Q4140366 / rank @@
+Normal rank
@@ Property / cites work @@
+The subgraph homeomorphism problem
@@ Property / cites work: The subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank