41 resultados para Polynomial Approximation
Resumo:
Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of techniques.
Resumo:
2000 Mathematics Subject Classification: 26A33 (primary), 35S15 (secondary)
Resumo:
2000 Mathematics Subject Classification: 26A33 (primary), 35S15
Resumo:
Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90
Resumo:
* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005.
Resumo:
The eccentric connectivity index of a graph G, ξ^C, was proposed by Sharma, Goswami and Madan. It is defined as ξ^C(G) = ∑ u ∈ V(G) degG(u)εG(u), where degG(u) denotes the degree of the vertex x in G and εG(u) = Max{d(u, x) | x ∈ V (G)}. The eccentric connectivity polynomial is a polynomial version of this topological index. In this paper, exact formulas for the eccentric connectivity polynomial of Cartesian product, symmetric difference, disjunction and join of graphs are presented.
Resumo:
2000 Mathematics Subject Classification: 12D10.
Resumo:
2000 Mathematics Subject Classification: 46B03
Resumo:
000 Mathematics Subject Classification: Primary 16R50, Secondary 16W55.
Resumo:
2000 Mathematics Subject Classification: 13P05, 14M15, 14M17, 14L30.
Resumo:
2000 Mathematics Subject Classification: Primary 81R50, 16W50, 16S36, 16S37.
Resumo:
2000 Mathematics Subject Classification: 41A05.
Resumo:
2000 Mathematics Subject Classification: 12D10.
Resumo:
2000 Mathematics Subject Classification: Primary 20F55, 13F20; Secondary 14L30.
Resumo:
2010 Mathematics Subject Classification: Primary 35S05, 35J60; Secondary 35A20, 35B08, 35B40.