Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Hypergraph Transversal Computation with Binary Decision Diagrams

    We study a hypergraph transversal computation: given a hypergraph, the problem is to generate all minimal transversals. This problem is related to many applications in computer science and various algorithms h...

    Takahisa Toda in Experimental Algorithms (2013)

  2. No Access

    Chapter and Conference Paper

    Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems

    We present a fast algorithm to compress hypergraphs into the data structure ZDDs. We furthermore analyze the computational complexity. Our algorithm uses multikey Quicksort given by Bentley and Sedgewick. By c...

    Takahisa Toda in Discovery Science (2013)