✦ LIBER ✦

Generating and counting unlabeled -path graphs

✍ Scribed by Pereira, Paulo Renato da Costa; Garcia, Alex; Markenzon, Lilian

Book ID: 121902779
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 278 KB
Volume: 164
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Succinct representation of general unlab

Succinct representation of general unlabeled graphs

✍ Moni Naor 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 328 KB

Generating and Counting Hamilton Cycles

Generating and Counting Hamilton Cycles in Random Regular Graphs

✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ž . with vertex set n . We describe polynomial time algorithms that whp i find a Ž . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.

Counting maximal independent sets in dir

Counting maximal independent sets in directed path graphs

✍ Lin, Min-Sheng; Su, Sheng-Huang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Approximately Counting Hamilton Paths an

Approximately Counting Hamilton Paths and Cycles in Dense Graphs

✍ Dyer, Martin; Frieze, Alan; Jerrum, Mark 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 265 KB

Counting labeled general cubic graphs

✍ Gab-Byung Chae; Edgar M. Palmer; Robert W. Robinson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 KB

Generalized fibonacci maximum path graph

Generalized fibonacci maximum path graphs

✍ Martin Charles Golumbic; Yehoshua Perl 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 723 KB