Eulerian walks in temporal graphs (Q2689257): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-022-01021-y
@@ Property / DOI: 10.1007/s00453-022-01021-y / rank @@
-Normal rank
@@ 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-022-01021-y
+Normal rank
@@ Property / OpenAlex ID @@
+W4293017958
@@ Property / OpenAlex ID: W4293017958 / rank @@
+Normal rank
@@ Property / cites work @@
+The temporal explorer who returns to the base
@@ Property / cites work: The temporal explorer who returns to the base / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of graphs into paths and cycles
@@ Property / cites work: Decomposition of graphs into paths and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Edge exploration of temporal graphs
@@ Property / cites work: Edge exploration of temporal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A time-dependent hierarchical Chinese postman problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of Eulerian deletion problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Postman tour on a graph with precedence relation on arcs
+Normal rank
@@ Property / cites work @@
+Q5005137
@@ Property / cites work: Q5005137 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-strict Temporal Exploration
@@ Property / cites work: Non-strict Temporal Exploration / rank @@
+Normal rank
@@ Property / cites work @@
+On temporal graph exploration
@@ Property / cites work: On temporal graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Long Circuits and Large Euler Subgraphs
@@ Property / cites work: Long Circuits and Large Euler Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
+Normal rank
@@ Property / cites work @@
+Q5519709
@@ Property / cites work: Q5519709 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity and inference problems for temporal networks
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Königsberg sightseeing: Eulerian walks in temporal graphs
+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 @@
+Q3338297
@@ Property / cites work: Q3338297 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-constrained Chinese postman problems
@@ Property / cites work: Time-constrained Chinese postman problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-022-01021-Y
@@ Property / DOI: 10.1007/S00453-022-01021-Y / rank @@
+Normal rank