
#1
Jan2213, 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? 



#2
Jan2313, 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 