Core Concepts
Temporal Vertex Cover complexity on sparse graphs is NP-hard.
Abstract
This article explores the complexity of Temporal Vertex Cover (TVC) and Sliding-Window Temporal Vertex Cover (∆-TVC) on sparse graphs. It shows that ∆-TVC is NP-hard even for simple topologies like paths or cycles, while TVC can be solved efficiently in the same settings. The study provides insights into the challenges and solutions for covering edges in dynamic networks over time.
Abstract:
Temporal graphs model changing network topologies over time.
TVC and ∆-TVC extend classic Vertex Cover to dynamic networks.
Introduction:
Modern networks are dynamic, requiring monitoring over time.
Temporal graphs have been studied extensively from various perspectives.
Paths and Cycles:
NP-hardness results for ∆-TVC on path or cycle topologies.
High-Level Description:
Reduction from planar monotone rectilinear 3SAT to temporal graph construction.
Size of Optimum 2-TVC:
Detailed analysis of vertex appearances needed for optimal coverings.
Stats
∆-TVCはNP困難であることが示されています。
∆=2の場合、最小次数が3のグラフでもNP困難です。