✦ LIBER ✦

An algorithm for enumerating simple chains in a graph

✍ Scribed by L.I. Kicha; E.I. Litvak

Publisher: Elsevier Science
Year: 1975
Weight: 171 KB
Volume: 15
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(75)90191-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for Enumerating All Spannin

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

✍ S. Kapoor; H. Ramesh 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 61 KB

An algorithm for enumerating all simple

An algorithm for enumerating all simple paths in a communication network

✍ R.B. Misra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 235 KB

A new simple algorithm for enumerating a

A new simple algorithm for enumerating all minimal paths and cuts of a graph

✍ Yuanlong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A simple algorithm for enumerating longe

A simple algorithm for enumerating longest distances in the plane

✍ Matthew T. Dickerson; Jason Shugart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 545 KB

Simple Markov-chain algorithms for gener

Simple Markov-chain algorithms for generating bipartite graphs and tournaments

✍ Ravi Kannan; Prasad Tetali; Santosh Vempala 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the first problem, we cannot prove that our chain is rapidly mixing in g

An optimal visibility graph algorithm fo

An optimal visibility graph algorithm for triangulated simple polygons

✍ John Hershberger 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 973 KB