A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

Lozin VV, Milanic M (2008)
J. Discr. Alg. 6(4): 595-604.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor
;
Erscheinungsjahr
Zeitschriftentitel
J. Discr. Alg.
Band
6
Zeitschriftennummer
4
Seite
595-604
ISSN
PUB-ID

Zitieren

Lozin VV, Milanic M. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discr. Alg. 2008;6(4):595-604.
Lozin, V. V., & Milanic, M. (2008). A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discr. Alg., 6(4), 595-604. doi:10.1016/j.jda.2008.04.001
Lozin, V. V., and Milanic, M. (2008). A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discr. Alg. 6, 595-604.
Lozin, V.V., & Milanic, M., 2008. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discr. Alg., 6(4), p 595-604.
V.V. Lozin and M. Milanic, “A polynomial algorithm to find an independent set of maximum weight in a fork-free graph”, J. Discr. Alg., vol. 6, 2008, pp. 595-604.
Lozin, V.V., Milanic, M.: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discr. Alg. 6, 595-604 (2008).
Lozin, V. V., and Milanic, M. “A polynomial algorithm to find an independent set of maximum weight in a fork-free graph”. J. Discr. Alg. 6.4 (2008): 595-604.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar