Balanced problems on graphs with categorization of edges
Discussiones Mathematicae. Graph Theory, Tome 23 (2003) no. 1, pp. 5-21
Voir la notice de l'article provenant de la source Library of Science
Suppose a graph G = (V,E) with edge weights w(e) and edges partitioned into disjoint categories S₁,...,Sₚ is given. We consider optimization problems on G defined by a family of feasible sets (G) and the following objective function:
Keywords:
algorithms on graphs, categorization of edges, NP-completeness
@article{DMGT_2003_23_1_a0,
author = {Bere\v{z}n\'y, \v{S}tefan and Lacko, Vladim{\'\i}r},
title = {Balanced problems on graphs with categorization of edges},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {5--21},
publisher = {mathdoc},
volume = {23},
number = {1},
year = {2003},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2003_23_1_a0/}
}
TY - JOUR AU - Berežný, Štefan AU - Lacko, Vladimír TI - Balanced problems on graphs with categorization of edges JO - Discussiones Mathematicae. Graph Theory PY - 2003 SP - 5 EP - 21 VL - 23 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2003_23_1_a0/ LA - en ID - DMGT_2003_23_1_a0 ER -
Berežný, Štefan; Lacko, Vladimír. Balanced problems on graphs with categorization of edges. Discussiones Mathematicae. Graph Theory, Tome 23 (2003) no. 1, pp. 5-21. http://geodesic.mathdoc.fr/item/DMGT_2003_23_1_a0/