2000 character limit reached
A new path algorithm for the weighted multi-graphs WMGPA: application to the Direct Topological Method
Published 2 Jul 2012 in cs.DS | (1207.0370v1)
Abstract: The aim of this paper is to present an algorithm which gives all the possible paths that start from a specific node to another of a weighted multi-graph. This algorithm is intended to be applied for the direct topological method.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.