Maximum independent sets in graphs of low degree
Lozin VV, Milanic M (2007)
In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 874-880.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
No fulltext has been uploaded
Author
Lozin, V.V.
;
Milanic, M.
Department
Publishing Year
PUB-ID
Cite this
Lozin VV, Milanic M. Maximum independent sets in graphs of low degree. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 2007: 874-880.
Lozin, V. V., & Milanic, M. (2007). Maximum independent sets in graphs of low degree. Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 874-880
Lozin, V. V., and Milanic, M. (2007). “Maximum independent sets in graphs of low degree” in Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007) 874-880.
Lozin, V.V., & Milanic, M., 2007. Maximum independent sets in graphs of low degree. In Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). pp. 874-880.
V.V. Lozin and M. Milanic, “Maximum independent sets in graphs of low degree”, Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 2007, pp.874-880.
Lozin, V.V., Milanic, M.: Maximum independent sets in graphs of low degree. Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). p. 874-880. (2007).
Lozin, V.V., and Milanic, M. “Maximum independent sets in graphs of low degree”. Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 2007. 874-880.
This data publication is cited in the following publications:
This publication cites the following data publications:
Google Scholar