✦ LIBER ✦

Enumeration of all circuits of a graph

✍ Scribed by Bapeswara Rao, V.V.; Murti, V.G.K.

Book ID: 115505159
Publisher: IEEE
Year: 1969
Tongue: English
Weight: 231 KB
Volume: 57
Category: Article
ISSN: 0018-9219
DOI: 10.1109/proc.1969.7032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of all circuits or cutsets o

Enumeration of all circuits or cutsets of a graph

✍ Bapeswara Rao, V.V.; Murti, V.G.K. 📂 Article 📅 1970 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 265 KB

A Petri net approach to enumerating all

A Petri net approach to enumerating all circuits of a graph

✍ G.S Hura 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 223 KB

A Petri net approach to enumerating all

A Petri net approach to enumerating all circuits of a graph : G. S. Hura. Microelectron. Reliab.24, 387 (1984)

📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Enumeration of all trees of a graph

✍ Rao, V.V.B.; Murti, V.G.K. 📂 Article 📅 1969 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 335 KB

Enumeration of the Elementary Circuits o

Enumeration of the Elementary Circuits of a Directed Graph

✍ Tarjan, Robert 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 626 KB

Efficient enumeration of all minimal sep

Efficient enumeration of all minimal separators in a graph

✍ Hong Shen; Weifa Liang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 796 KB

This paper presents an efficient algorithm for enumerating all minimal a-b separators separating given non-adjacent vertices a and b in an undirected connected simple graph G = (V,E). Our algorithm requires O(n3R,b) time, which improves the known result of 0(n4R,b) time for solving this problem, whe