Towards Computing a Near-Maximum Weighted Independent Set on Massive Graphs-Reference-Cited by-同舟云学术

Towards Computing a Near-Maximum Weighted Independent Set on Massive Graphs

Published:2021-08-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining
language:
Short-container-title:

Author:

Gu Jiewei¹,Zheng Weiguo¹,Cai Yuzheng¹,Peng Peng²

Affiliation:

1. Fudan University, Shanghai, China

2. Hunan University, Hunan, China

Funder

National Key Research and Development Program of China under grant

National Natural Science Foundation of China

Science and Technology Committee Shanghai Municipality

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3447548.3467232

Reference39 articles.

1. Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover

2. Fast local search for the maximum independent set problem

3. A maximum independent set approach for collusion detection in voting pools

4. William Brendel Mohamed R. Amer and Sinisa Todorovic. [n.d.]. Multiobject tracking as maximum weight independent set. In CVPR. 1273--1280. William Brendel Mohamed R. Amer and Sinisa Todorovic. [n.d.]. Multiobject tracking as maximum weight independent set. In CVPR. 1273--1280.

5. Segmentation as Maximum-Weight Independent Set;Brendel William;NIPS,2010

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding small feedback arc sets on large graphs;Computers & Operations Research;2024-09

2. Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems;Communications of the ACM;2024-03-25

3. Efficient computation of maximum weighted independent sets on weighted dynamic graph;The Journal of Supercomputing;2023-12-22

4. Finding Near-Optimal Weight Independent Sets at Scale;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12