Computing invariants in graphs of small bandwidth

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.

MoreLess

Year of publication:	1999
Authors:	Pönitz, André
Published in:	Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 49.1999, 3, p. 179-191
Publisher:	Elsevier
Subject:	Chromatic polynomial \| Recurrence relations \| Composition method \| Polynomial invariants

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011050667