Полиномы надежности графоидных гиперграфов
Loading...
Files
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The main result of the paper is that the problem of computing the allterminal reliability polynomials is complete even restricted to Hamiltonian graphs.
Description
Keywords
теория графов, гиперграф