Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-012-9481-z
@@ Property / DOI: 10.1007/s10878-012-9481-z / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6235160
@@ Property / zbMATH DE Number: 6235160 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+non-separating path
@@ Property / zbMATH Keywords: non-separating path / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+balanced connected partition
@@ Property / zbMATH Keywords: balanced connected partition / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+grid graphs
@@ Property / zbMATH Keywords: grid graphs / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1557249042
@@ Property / OpenAlex ID: W1557249042 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5915
@@ Property / arXiv ID: 1105.5915 / rank @@
+Normal rank
@@ Property / cites work @@
+Max-min partitioning of grid graphs into connected components
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for max-min partitioning of ladders
+Normal rank
@@ Property / cites work @@
+Lowest common ancestors in trees and directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Highly linked graphs
@@ Property / cites work: Highly linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387695
@@ Property / cites work: Q5387695 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph connectivity after path removal
@@ Property / cites work: Graph connectivity after path removal / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Maximally Balanced Connected Partition Problem in graphs
+Normal rank
@@ Property / cites work @@
+Computing an st-numbering
@@ Property / cites work: Computing an st-numbering / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Non-separating paths in 4-connected graphs
@@ Property / cites work: Non-separating paths in 4-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A weaker version of Lovász' path removal conjecture
+Normal rank
@@ Property / cites work @@
+A homology theory for spanning tress of a graph
@@ Property / cites work: A homology theory for spanning tress of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Max-Min Tree Partitioning
@@ Property / cites work: Max-Min Tree Partitioning / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-012-9481-Z
@@ Property / DOI: 10.1007/S10878-012-9481-Z / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:385485