๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


The complexity of the T-coloring problem
โœ Krzysztof Giaro; Robert Janczewski; Michaล‚ Maล‚afiejski ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

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

Representation of Zn(II) complexes in po
โœ Nohad Gresh; Jean-Philip Piquemal; Morris Krauss ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 452 KB

## 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