✦ LIBER ✦

Distributed processing of graphs: Fundamental cycles algorithm

✍ Scribed by Pranay Chaudhuri

Book ID: 107766541
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 757 KB
Volume: 60
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(92)90004-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for finding a fundamental s

An algorithm for finding a fundamental set of cycles of a graph

✍ Paton, Keith 📂 Article 📅 1969 🏛 Association for Computing Machinery 🌐 English ⚖ 559 KB

A Self-Stabilizing Algorithm for Detecti

A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph

✍ Pranay Chaudhuri 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Parallel algorithms for finding a subopt

Parallel algorithms for finding a suboptimal fundamental-cycle set in a graph

✍ Zbigniew J. Czech; Marek Konopka; Bohdan S. Majewski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 639 KB

A comparison of three algorithms for fin

A comparison of three algorithms for finding fundamental cycles in a directed graph

✍ Doris R. Ryan; Stephen Chen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB

## Abstract Given a connected directed graph and a spanning tree, we consider the problem of finding the set of fundamental cycles. In particular, for each cotree arc __i__ and tree arc __j__, we need to know whether or not __i__ and __j__ are in the same fundamental cycle, and if so, whether or no

Efficient algorithms for synthesizing gr

Efficient algorithms for synthesizing graphs with given sets of fundamental cuts and cycles

✍ V. F. Rotko 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 681 KB

Distribution of Cycle Lengths in Graphs

✍ Genghua Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Bondy and Vince proved that every graph with minimum degree at least three contains two cycles whose lengths differ by one or two, which answers a question raised by Erdo ˝s. By a different approach, we show in this paper that if G is a graph with minimum degree d(G) \ 3k for any positive integer k,