共 50 条
- [41] The Complexity of Temporal Vertex Cover in Small-Degree Graphs THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 10193 - 10201
- [46] Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 74 - +
- [48] Vertex Cover Gets Faster and Harder on Low Degree Graphs COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 179 - 190