The computational complexity of graph problems with succinct multigraph representation
โ Scribed by M. Karpinski; K. W. Wagner
- Publisher
- Springer
- Year
- 1988
- Tongue
- English
- Weight
- 451 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In the paper we consider a generalized vertex coloring model, namely T -coloring. For a given รฟnite set T of nonnegative integers including 0, a proper vertex coloring is called a T -coloring if the distance of the colors of adjacent vertices is not an element of T . This problem is a generalization
## Abstract We present refinements of the SIBFA molecular mechanics procedure to represent the intermolecular interaction energies of Zn(II). The two firstโorder contributions, electrostatic (__E__~MTP~), and shortโrange repulsion (__E__~rep~), are refined following the recent developments due to P