Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

JCT
2007

favoriteEmaildiscussreport

90views more JCT 2007»

Enumeration problems for classes of self-similar graphs

13 years 4 months ago

Enumeration problems for classes of self-similar graphs

Download finanz.math.tu-graz.ac.at

We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically. This is shown for diﬀerent examples involving classical self-similar graphs such as the Sierpi´nski graphs. The enumeration problems we investigate include counting independent subsets, matchings and connected subsets.

Elmar Teufl, Stephan Wagner

Real-time Traffic

Enumeration Problems | JCT 2007 | Self-similar Graphs | Various Enumeration Problems |

claim paper

Related Content

» Enumerative Problems Inspired by Mayers Theory of Cluster Integrals

» Canonical Data Structure for Interval Probe Graphs

» Time and Space Efficient Discovery of Maximal Geometric Graphs

» Compact Navigation and Distance Oracles for Graphs with Small Treewidth

» Can you beat treewidth

» Pure Nash equilibria complete characterization of hard and easy graphical games

» Lambda Theories of Effective Lambda Models

» On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata

» Efficient parallel and out of core algorithms for constructing large bidirected de Bruijn ...

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Elmar Teufl, Stephan Wagner

Comments (0)