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.
Konferenzbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Lozin, V.V.;
Milanic, M.
Einrichtung
Erscheinungsjahr
2007
Titel des Konferenzbandes
Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)
Seite(n)
874-880
Page URI
https://pub.uni-bielefeld.de/record/2499467
Zitieren
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., 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.
Google Scholar