共 50 条
[41]
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
[J].
INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS,
2019, 43 (02)
:177-186
[43]
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs
[J].
28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011),
2011, 9
:519-530
[47]
Local search algorithms for finding the Hamiltonian completion number of line graphs
[J].
Annals of Operations Research,
2007, 156
:5-24
[48]
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)
[J].
COMPUTING AND COMBINATORICS (COCOON 2021),
2021, 13025
:617-628
[50]
Fully Dynamic Exact Edge Connectivity in Sublinear Time
[J].
PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA,
2023,
:70-86