Maximum number of path for simple acyclic directed graph with start and end node


by jack1234
Tags: acyclic, directed, graph, maximum, node, number, path, simple, start
jack1234
jack1234 is offline
#1
Jan22-13, 08:56 PM
P: 134
Say given a simple acyclic directed graph with n nodes , which includes a starting node s0 and ending node e0 (i.e., a kripke structure without loop)
what is the maximum number of path from s0 to e0?
Phys.Org News Partner Science news on Phys.org
SensaBubble: It's a bubble, but not as we know it (w/ video)
The hemihelix: Scientists discover a new shape using rubber bands (w/ video)
Microbes provide insights into evolution of human language
bpet
bpet is offline
#2
Jan23-13, 03:18 AM
P: 523
The solution could be written in terms of powers of the (nilpotent) adjacency matrix.


Register to reply

Related Discussions
Where to start on the path of enlightenment?(and other help) General Discussion 15
Minimum number of edges in a graph of order n with chromatic number k Set Theory, Logic, Probability, Statistics 1
Directed acyclic graph profit sorting Set Theory, Logic, Probability, Statistics 3
Directed distance to a directed line Precalculus Mathematics Homework 0
Scaling node coordinates to a fixed graph size General Math 1