ScholarLens Back to search
2016•International Journal of Mathematical ArchiveRequires access

ALGORITHM TO FIND TOTAL NUMBER OF PATHS IN DIRECTED ACYCLIC GRAPH

Ishwar Baidari, Sharanu P. Sajjan

Open publisher page 0 citations

Abstract

A directed acyclic graph (DAG) is a graph with directed edges in which there are no cycles. Formally, a directed graph is a pair (N,R ⊆ N×N) consisting of a set of Nodes N and a binary relation R on it that specifies a directed edge from a node n to another one m whenever (n, m). IN this paper we presented on polynomial time algorithm to find total number of path in DAG.

About this research paper

What this paper is about

A directed acyclic graph (DAG) is a graph with directed edges in which there are no cycles. Formally, a directed graph is a pair (N,R ⊆ N×N) consisting of a set of Nodes N and a binary relation R on it that specifies a directed edge from a node n to another one m whenever (n, m). IN this paper we presented on polynomial time algorithm to find total number of path in DAG.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A directed acyclic graph (DAG) is a graph with directed edges in which there are no cycles. Formally, a directed graph is a pair (N,R ⊆ N×N) consisting of a set of Nodes N and a binary relation R on it that specifies a directed edge from a node n to another one m whenever (n, m). IN this paper we presented on polynomial time algorithm to find total number of path in DAG.

Key concepts: Directed acyclic graph, Combinatorics, Feedback arc set, Directed graph, Mathematics, Discrete mathematics, Graph, Moral graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
ALGORITHM TO FIND TOTAL NUMBER OF PATHS IN DIRECTED ACYCLIC GRAPH — Research Paper | ScholarLens