Efficient Algorithms for Measuring the Funnel-likeness of DAGs
2987200610, pp. 1-30, 2020.
Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if every source-sink path can be uniquely identified by one of its arcs. Funnels are an analog to trees for directed graphs that is more restrictive than DAGs but more expressive than in-/out-trees. Computational problems such as finding vertex-disjoint paths or tr...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)