Paths through K-specified edges in a linear graph

Paths through K-specified edges in a linear graph

0.00 Avg rating—0 Votes
Article ID: iaor19941075
Country: India
Volume: 30
Issue: 2
Start Page Number: 163
End Page Number: 173
Publication Date: Jun 1993
Journal: OPSEARCH
Authors: ,
Abstract:

This paper presents an algorithm to determine all paths without any circuit through a given set of K-specified edges using the ring sum technique. It is assumed that the linear graph is simple, connected, free of self loops and nonoriented.

Reviews

Required fields are marked *. Your email address will not be published.