eldorado.tu-dortmund.de/server/api/core/bitstreams/add7edb9-da6b-4ff7-86d3-f5c588d32f0e/content
Parallel Path Progression DAG Scheduling
example, we start at u4 = (9) with π4 = 〈v9〉, which is a sink vertex in G and identify tuple u2 = (4, 5, 6) since (v5, v9) ∈ E and the path is updated to π4 = 〈v4, v5, v9〉. Since v4 is not a source vertex [...] v3〉, π2 = 〈v1, v7, v8〉, π3 = 〈v1, v4, v5, v6〉, and π4 = 〈v1, v4, v5, v9〉, which collectively cover all vertexes v ∈ V . Please note that while in this example, w = 4 is the minimal number of paths to coverG [...] consists of six paths {π1, π2, . . . , π6}, namely; π1 := 〈v1, v2, v3〉, π2 := 〈v1, v4, v5, v9〉, π3 := 〈v1, v4, v5, v6〉, π4 := 〈v1, v7, v5, v9〉, π5 := 〈v1, v7, v5, v6〉, and π6 := 〈v1, v7, v8〉. A 2-path col- …
