Skip to main content

2 Result(s)

within Manuel Sorge Remove this filter Operations Research/Decision Theory Remove this filter

and

  1. No Access

    Article

    Efficient algorithms for measuring the funnel-likeness of DAGs

    We propose funnels as 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 analogue to trees for directed graph...

    Marcelo Garlet Millani, Hendrik Molter… in Journal of Combinatorial Optimization (2020)

  2. No Access

    Article

    Exact combinatorial algorithms and experiments for finding maximum k-plexes

    We propose new practical algorithms to find maximum-cardinality k-plexes in graphs. A k-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most k vertices in th...

    Hannes Moser, Rolf Niedermeier, Manuel Sorge in Journal of Combinatorial Optimization (2012)