Resource
Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs
PDF
PDF format is widely accepted and good for printing.
PDF-1(730.69 kb)

Citation & Export
Hide

Simple citation

Milanic, Martin. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. Retrieved from https://doi.org/doi:10.7282/T3K64JH9

Export

Statistics
Hide

Version 8.3.5
Rutgers University Libraries - Copyright ©2018