por que contenga las palabras

Busqueda avanzada

1 documento corresponde a la consulta.
Palabras contadas: multiplicative: 7, version: 20
Dickenstein, A. - Tobis, E.A.
Discrete Appl Math 2010;158(5):444-452
2010

Descripción: Let G = (V, E) be a graph and d a positive integer. We study the following problem: for which labelings fE : E → Zd is there a labeling fV : V → Zd such that fE (i, j) = fV (i) + fV (j) (mod d), for every edge (i, j) ∈ E? We also explore the connections of the equivalent multiplicative version to toric ideals. We derive a polynomial algorithm to answer these questions and to obtain all possible solutions. © 2009 Elsevier B.V. All rights reserved.
...ver más

Tipo de documento: info:ar-repo/semantics/artículo