Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Abstract
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In

Copyright
History
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- An exact algorithm to find a maximum weight clique in a weighted undirected graphScientific Reports, Vol. 14, No. 1 | 20 April 2024
- Efficient identification of maximum independent sets in stochastic multilayer graphs with learning automataResults in Engineering, Vol. 24 | 1 Dec 2024
- Finding Near-Optimal Weight Independent Sets at ScaleProceedings of the Genetic and Evolutionary Computation Conference | 12 July 2023
- Recent Advances in Practical Data ReductionAlgorithms for Big Data | 18 January 2023
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].