On the negative cost girth problem in planar networks (Q891820): 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/j.jda.2015.10.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2193718508
@@ Property / OpenAlex ID: W2193718508 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501344
@@ Property / cites work: Q5501344 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Girth of a Planar Graph in Linear Time
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Partitioning Planar Graphs
@@ Property / cites work: On the Problem of Partitioning Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754199
@@ Property / cites work: Q2754199 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886099
@@ Property / cites work: Q4886099 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Planar separators and parallel polygon triangulation.
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for min cut and max flow in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Nested Dissection
@@ Property / cites work: Generalized Nested Dissection / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of determining a shortest cycle of even length
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of totally clairvoyant scheduling
@@ Property / cites work: An analysis of totally clairvoyant scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal length resolution refutations of difference constraint systems
+Normal rank
@@ Property / cites work @@
+Improved algorithms for optimal length resolution refutation in difference constraint systems
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Girth of a Planar Graph in $O(n \logn)$ Time
+Normal rank
@@ Property / cites work @@
+Finding Even Cycles Even Faster
@@ Property / cites work: Finding Even Cycles Even Faster / rank @@
+Normal rank