Computational complexity of counting problems on 3-regular planar graphs

A variety of counting problems on 3-regular planar graphs are considered in this paper. We give a sufficient condition which guarantees that the coefficients of a homogeneous polynomial can be uniquely determined by its values on a recurrence sequence. This result enables us to use the polynomial in...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 384; H. 1; S. 111 - 125
Hauptverfasser:	Xia, Mingji, Zhang, Peng, Zhao, Wenbo
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 24.09.2007 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Holographic reduction Information retrieval. Graph Matching Mathematics Miscellaneous Numerical analysis Numerical analysis. Scientific computation Numerical approximation P-completeness Sciences and techniques of general use Theoretical computing Vertex cover Matching Vertex cover Holographic reduction P-completeness Polynomial Recurrence Vertex Computer theory Recurrence relation Planar graph Computational complexity Sufficient condition Completeness Polynomial interpolation Application Variety Counting Regular graph
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!