Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.12.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2208043519
@@ Property / OpenAlex ID: W2208043519 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for embedding planar graphs using PQ-trees
+Normal rank
@@ Property / cites work @@
+Algorithms for Generating Fundamental Cycles in a Graph
+Normal rank
@@ Property / cites work @@
+Q3374865
@@ Property / cites work: Q3374865 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the minimum strictly fundamental cycle basis problem
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
+Normal rank
@@ Property / cites work @@
+An improved heuristic for computing short integral cycle bases
+Normal rank
@@ Property / cites work @@
+Cycle bases in graphs characterization, algorithms, complexity, and applications
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for minimum cycle bases of graphs
+Normal rank
@@ Property / cites work @@
+An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
+Normal rank
@@ Property / cites work @@
+Periodic Timetable Optimization in Public Transport
+Normal rank
@@ Property / cites work @@
+Minimum weakly fundamental cycle bases are hard to find
+Normal rank