The edge versus path incidence matrix of series-parallel graphs and greedy packing (Q5951970)

Suppose \(G\) is a series-parallel directed graph with endpoints \(s\) and \(t\). An edge-path incidence matrix \(A\) is a \((0,1)\) matrix in which each row corresponds to an edge of \(G\) and each column corresponds to a directed \((s,t)\) path. The \((i,j)\) element of \(A\) is 1 if edge \(i\) is in the \(j\) \((s,t)\) path; otherwise the element is 0. The authors characterize \(A\) structurally and algorithmically and note that the results relate to the max-flow problem in series-parallel graphs and a solution to a packing problem.