On the complexity of paths avoiding forbidden pairs (Q967328): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.dam.2009.03.018
-Normal rank
@@ Property / OpenAlex ID @@
-W2114795697
@@ Property / OpenAlex ID: W2114795697 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2009.03.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2114795697
@@ Property / OpenAlex ID: W2114795697 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths and deleting edges in directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Impossible pair constrained test path generation in a program
+Normal rank
@@ Property / cites work @@
+On paths avoding forbidden pairs of vertices in a graph
+Normal rank