Minimum weakly fundamental cycle bases are hard to find (Q1024786): 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.1007/s00453-007-9112-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1972660489
@@ Property / OpenAlex ID: W1972660489 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56020351
@@ Property / Wikidata QID: Q56020351 / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem
+Normal rank
@@ Property / cites work @@
+Algorithms for finding minimum fundamental cycle bases in graphs
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542533
@@ Property / cites work: Q4542533 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cycle bases for network graphs
@@ Property / cites work: Minimum cycle bases for network graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4830805
@@ Property / cites work: Q4830805 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4410005
@@ Property / cites work: Q4410005 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Generating Fundamental Cycles in a Graph
+Normal rank
@@ Property / cites work @@
+New length bounds for cycle bases
@@ Property / cites work: New length bounds for cycle bases / rank @@
+Normal rank
@@ Property / cites work @@
+Q5342984
@@ Property / cites work: Q5342984 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3046492
@@ Property / cites work: Q3046492 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242793
@@ Property / cites work: Q4242793 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approach to compute a minimum cycle basis of a directed graph
+Normal rank
@@ Property / cites work @@
+Classes of cycle bases
@@ Property / cites work: Classes of cycle bases / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3059320
@@ Property / cites work: Q3059320 / rank @@
+Normal rank
@@ Property / cites work @@
+On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
+Normal rank
@@ Property / cites work @@
+Q4477783
@@ Property / cites work: Q4477783 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Abstract Properties of Linear Dependence
@@ Property / cites work: On the Abstract Properties of Linear Dependence / rank @@
+Normal rank