On exploring always-connected temporal graphs of small pathwidth (Q1628692): Difference between revisions

@@ Property / OpenAlex ID @@
+W2898312999
@@ Property / OpenAlex ID: W2898312999 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59567334
@@ Property / Wikidata QID: Q59567334 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.11869
@@ Property / arXiv ID: 1807.11869 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Hamiltonicity Checking Via Bases of Perfect Matchings
+Normal rank
@@ Property / cites work @@
+On temporal graph exploration
@@ Property / cites work: On temporal graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal graph classes: a view through temporal separators
+Normal rank
@@ Property / cites work @@
+Connectivity and inference problems for temporal networks
+Normal rank
@@ Property / cites work @@
+An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Traveling salesman problems in temporal graphs
@@ Property / cites work: Traveling salesman problems in temporal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3836524
@@ Property / cites work: Q3836524 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank