Tree-width and Optimization in Bounded Degree Graphs
Lozin VV, Milanic M (2007)
In: Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007). Brandstädt A (Ed); Lecture notes in computer science, 4769. Berlin, Heidelberg: Springer Berlin Heidelberg: 45-54.
Konferenzbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Lozin, V.V;
Milanic, M.
Herausgeber*in
Brandstädt, Andreas
Einrichtung
Erscheinungsjahr
2007
Titel des Konferenzbandes
Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007)
Serien- oder Zeitschriftentitel
Lecture notes in computer science
Band
4769
Seite(n)
45-54
ISBN
9783540748380
Page URI
https://pub.uni-bielefeld.de/record/2499472
Zitieren
Lozin VV, Milanic M. Tree-width and Optimization in Bounded Degree Graphs. In: Brandstädt A, ed. Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007). Lecture notes in computer science. Vol 4769. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007: 45-54.
Lozin, V. V., & Milanic, M. (2007). Tree-width and Optimization in Bounded Degree Graphs. In A. Brandstädt (Ed.), Lecture notes in computer science: Vol. 4769. Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007) (pp. 45-54). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-540-74839-7_5
Lozin, V.V, and Milanic, M. 2007. “Tree-width and Optimization in Bounded Degree Graphs”. In Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), ed. Andreas Brandstädt, 4769:45-54. Lecture notes in computer science. Berlin, Heidelberg: Springer Berlin Heidelberg.
Lozin, V. V., and Milanic, M. (2007). “Tree-width and Optimization in Bounded Degree Graphs” in Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), Brandstädt, A. ed. Lecture notes in computer science, vol. 4769, (Berlin, Heidelberg: Springer Berlin Heidelberg), 45-54.
Lozin, V.V., & Milanic, M., 2007. Tree-width and Optimization in Bounded Degree Graphs. In A. Brandstädt, ed. Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007). Lecture notes in computer science. no.4769 Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 45-54.
V.V. Lozin and M. Milanic, “Tree-width and Optimization in Bounded Degree Graphs”, Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), A. Brandstädt, ed., Lecture notes in computer science, vol. 4769, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp.45-54.
Lozin, V.V., Milanic, M.: Tree-width and Optimization in Bounded Degree Graphs. In: Brandstädt, A. (ed.) Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007). Lecture notes in computer science. 4769, p. 45-54. Springer Berlin Heidelberg, Berlin, Heidelberg (2007).
Lozin, V.V, and Milanic, M. “Tree-width and Optimization in Bounded Degree Graphs”. Proc. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007). Ed. Andreas Brandstädt. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.Vol. 4769. Lecture notes in computer science. 45-54.
Google Scholar
ISBN Suche