Title of article
Computing invariants in graphs of small bandwidth Original Research Article
Author/Authors
André P?nitz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
13
From page
179
To page
191
Abstract
Many graph invariants (chromatic number, rook polynomial, Tutte polynomial, etc.) are known to be computable for general graphs in exponential time only. Algorithms for their computation usually depend on special properties of the invariants and are not extendable to slightly different problems.
Keywords
Recurrence relations , Chromatic polynomial , Polynomial invariants , Composition method
Journal title
Mathematics and Computers in Simulation
Serial Year
1999
Journal title
Mathematics and Computers in Simulation
Record number
853511
Link To Document