Assigning times to minimise reachability in temporal graphs (Q2208254): Difference between revisions

@@ Property / arXiv ID @@
+.05905
@@ Property / arXiv ID: 1802.05905 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimal design of temporally connected graphs
+Normal rank
@@ Property / cites work @@
+Connectivity and inference problems for temporal networks
+Normal rank
@@ Property / cites work @@
+Temporal Network Optimization Subject to Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Deleting edges to restrict the size of an epidemic: a new application for treewidth
+Normal rank
@@ Property / cites work @@
+The Complexity and Approximability of Minimum Contamination Problems
+Normal rank
@@ Property / cites work @@
+On the computational complexity of vertex integrity and component order connectivity
+Normal rank
@@ Property / cites work @@
+Temporal graph classes: a view through temporal separators
+Normal rank
@@ Property / cites work @@
+A constructive proof of Vizing's theorem
@@ Property / cites work: A constructive proof of Vizing's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank