The Maximum Independent Set Problem in Planar Graphs
Alekseev VE, Lozin VV, Malyshev D, Milanič M (2008)
In: Proc. MFCS 2008. Ochmański E (Ed); Lecture notes in computer science, 5162. Berlin, Heidelberg: Springer Berlin Heidelberg: 96-107.
Konferenzbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Alekseev, Vladimir E.;
Lozin, Vadim V.;
Malyshev, Dimitry;
Milanič, Martin
Herausgeber*in
Ochmański, Edward
Einrichtung
Erscheinungsjahr
2008
Titel des Konferenzbandes
Proc. MFCS 2008
Serien- oder Zeitschriftentitel
Lecture notes in computer science
Band
5162
Seite(n)
96-107
ISBN
9783540852377
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/2427252
Zitieren
Alekseev VE, Lozin VV, Malyshev D, Milanič M. The Maximum Independent Set Problem in Planar Graphs. In: Ochmański E, ed. Proc. MFCS 2008. Lecture notes in computer science. Vol 5162. Berlin, Heidelberg: Springer Berlin Heidelberg; 2008: 96-107.
Alekseev, V. E., Lozin, V. V., Malyshev, D., & Milanič, M. (2008). The Maximum Independent Set Problem in Planar Graphs. In E. Ochmański (Ed.), Lecture notes in computer science: Vol. 5162. Proc. MFCS 2008 (pp. 96-107). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_7
Alekseev, Vladimir E., Lozin, Vadim V., Malyshev, Dimitry, and Milanič, Martin. 2008. “The Maximum Independent Set Problem in Planar Graphs”. In Proc. MFCS 2008, ed. Edward Ochmański, 5162:96-107. Lecture notes in computer science. Berlin, Heidelberg: Springer Berlin Heidelberg.
Alekseev, V. E., Lozin, V. V., Malyshev, D., and Milanič, M. (2008). “The Maximum Independent Set Problem in Planar Graphs” in Proc. MFCS 2008, Ochmański, E. ed. Lecture notes in computer science, vol. 5162, (Berlin, Heidelberg: Springer Berlin Heidelberg), 96-107.
Alekseev, V.E., et al., 2008. The Maximum Independent Set Problem in Planar Graphs. In E. Ochmański, ed. Proc. MFCS 2008. Lecture notes in computer science. no.5162 Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 96-107.
V.E. Alekseev, et al., “The Maximum Independent Set Problem in Planar Graphs”, Proc. MFCS 2008, E. Ochmański, ed., Lecture notes in computer science, vol. 5162, Berlin, Heidelberg: Springer Berlin Heidelberg, 2008, pp.96-107.
Alekseev, V.E., Lozin, V.V., Malyshev, D., Milanič, M.: The Maximum Independent Set Problem in Planar Graphs. In: Ochmański, E. (ed.) Proc. MFCS 2008. Lecture notes in computer science. 5162, p. 96-107. Springer Berlin Heidelberg, Berlin, Heidelberg (2008).
Alekseev, Vladimir E., Lozin, Vadim V., Malyshev, Dimitry, and Milanič, Martin. “The Maximum Independent Set Problem in Planar Graphs”. Proc. MFCS 2008. Ed. Edward Ochmański. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008.Vol. 5162. Lecture notes in computer science. 96-107.
Google Scholar
ISBN Suche