Counting independent sets in Riordan graphs
نویسندگان
چکیده
منابع مشابه
Counting independent sets in graphs
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to ‘real-life’ combinat...
متن کاملOn Counting Independent Sets in Sparse Graphs
We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree ∆. The first implies that the Markov chain Monte Carlo technique is likely to fail if ∆ ≥ 6. The second shows that no fully polynomial randomized approximation scheme can exist for ∆ ≥ 25, unless RP = NP.
متن کاملCounting Independent Sets in Claw-Free Graphs
Although many of the counting problems (e.g. counting independent sets or matchings in a graph) are known to be #P-Complete (see Vadhan [3]), a remarkable progress has been done in designing exponential time algorithms solving them. Dahllöf, Jonsson, Wahlström [2] constructed algorithms that count maximum weight models of 2-SAT formulas in time O∗(1.2561n). This bound bound was later improved t...
متن کاملCounting independent sets in triangle-free graphs
Ajtai, Komlós, and Szemerédi proved that for sufficiently large t every trianglefree graph with n vertices and average degree t has an independent set of size at least n 100t log t. We extend this by proving that the number of independent sets in such a graph is at least 2 1 2400 n t log . This result is sharp for infinitely many t, n apart from the constant. An easy consequence of our result i...
متن کاملCounting the number of independent sets in chordal graphs
We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.112043