A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6585490
@@ Property / zbMATH DE Number: 6585490 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+flow
@@ Property / zbMATH Keywords: flow / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+residual graph
@@ Property / zbMATH Keywords: residual graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge-disjoint paths
@@ Property / zbMATH Keywords: edge-disjoint paths / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+clockwise circuit
@@ Property / zbMATH Keywords: clockwise circuit / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+counterclockwise circuit
@@ Property / zbMATH Keywords: counterclockwise circuit / rank @@
+Normal rank

Revision as of 18:56, 27 June 2023