9 research outputs found

    kk-Blocks: A Connectivity Invariant for Graphs

    No full text

    D-Width: A More Natural Measure for Directed Tree Width

    No full text

    Zentrale und dezentrale Elemente im Energiesystem - Der richtige Mix fĂĽr eine stabile und nachhaltige Versorgung

    No full text
    Nur mit einem Mix aus zentralen und dezentralen Technologien kann die Energieversorgung klimafreundlich, sicher und wirtschaftlich werden. Die Herausforderung liegt darin, die einzelnen Elemente zu einem funktionierenden Gesamtsystem zu integrieren

    Treewidth lower bounds with brambles

    Get PDF
    In this paper we present a new technique for computing lower bounds for graph treewidth. Our technique is based on the fact that the treewidth of a graph G is the maximum order of a bramble of G minus one. We give two algorithms: one for general graphs, and one for planar graphs. The algorithm for planar graphs is shown to give a lower bound for both the treewidth and branchwidth that is at most a constant factor away from the optimum. For both algorithms, we report on extensive computational experiments that show that the algorithms give often excellent lower bounds, in particular when applied to (close to) planar graphs
    corecore