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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 384; číslo 1; s. 111 - 125
Hlavní autori:	Xia, Mingji, Zhang, Peng, Zhao, Wenbo
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 24.09.2007 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!