Skip to main content

2 Result(s)

within Manuel Sorge Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Computer Communication Networks Remove this filter Data Structures Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Efficient Algorithms for Measuring the Funnel-Likeness of DAGs

    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 mo...

    Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier… in Combinatorial Optimization (2018)

  2. No Access

    Chapter and Conference Paper

    From Few Components to an Eulerian Graph by Adding Arcs

    Eulerian Extension (EE) is the problem to make an arc-weighted directed multigraph Eulerian by adding arcs of minimum total cost. EE is NP-hard and has been shown fixed-parameter tractable with res...

    Manuel Sorge, René van Bevern… in Graph-Theoretic Concepts in Computer Scien… (2011)