✦ LIBER ✦

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

✍ Scribed by Paton, Keith

Book ID: 125450884
Publisher: Association for Computing Machinery
Year: 1969
Tongue: English
Weight: 559 KB
Volume: 12
Category: Article
ISSN: 0001-0782
DOI: 10.1145/363219.363232

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Note on a modification of the fundamenta

Note on a modification of the fundamental cycles finding algorithm

✍ Antonije D. Jovanovich 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 116 KB

An algorithm for finding a large indepen

An algorithm for finding a large independent set in planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

A New Search Algorithm for Finding the S

A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph

✍ Weinblatt, Herbert 📂 Article 📅 1972 🏛 Association for Computing Machinery 🌐 English ⚖ 887 KB