
ANN
 Referenced in 46 articles
[sw09854]
 based on kdtrees and boxdecomposition trees, and employs a couple of different search...

htd
 Referenced in 12 articles
[sw21112]
 free, opensource framework for (customized) tree decompositions and beyond. Decompositions of graphs play ... that are NPhard in general. Tree decompositions are the most prominent concept in this ... context and several tools for computing tree decompositions recently competed in the 1st Parameterized Algorithms ... practice the quality of a tree decomposition cannot be judged without taking concrete algorithms that...

Treewidthlib
 Referenced in 13 articles
[sw09228]
 settings, algorithms are needed that generate tree decompositions with sufficiently small width, and that ... comparison of algorithms computing treewidth, tree decompositions, but also for algorithms that solve problems related...

DFLAT
 Referenced in 9 articles
[sw09895]
 FLAT: Declarative problem solving using tree decompositions and answerset programming. In this work ... dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed ... take care of building a tree decomposition and (ii) provide an interface for declarative specifications ... technical details concerned with parsing, tree decomposition, the handling of data structures, etc. Instead...

qTorch
 Referenced in 5 articles
[sw27767]
 contractions: one is based on the tree decomposition of the line graph, while the other ... time to calculate a reasonable tree decomposition is prohibitively expensive. Finally, we release our software...

SplitsTree
 Referenced in 32 articles
[sw12234]
 always clearly support a unique tree. To address this problem, Bandelt and Dress (Adv. Math ... split decomposition. For ideal data, this method gives rise to a tree, whereas less ideal...

SCWRL4
 Referenced in 7 articles
[sw22393]
 discrete oriented polytopes; 6) a tree decomposition algorithm to solve the combinatorial problem...

ToTo
 Referenced in 4 articles
[sw19369]
 computation, storage and retrieval of tree decompositions. Many NPhard problems on graphs become tractable ... corresponding algorithms require access to a tree decomposition of the graph of low (ideally, minimum ... computation, storage and rapid retrieval of tree decompositions. We hope that the database will become...

Jdrasil
 Referenced in 5 articles
[sw25570]
 Jdrasil: a modular library for computing tree decompositions. While the theoretical aspects concerning the computation...

twheuristic
 Referenced in 4 articles
[sw34759]
 used class of algorithms for computing tree decompositions of graphs are heuristics that compute...

STXXL
 Referenced in 18 articles
[sw06824]
 computing minimum spanning trees, connected components, breadthfirst search decompositions, constructing suffix arrays, and computing...

INDDGO
 Referenced in 2 articles
[sw23104]
 Integrated Network Decompositions & Dynamic programming for Graph Optimization (INDDGO). The INDDGO software package offers ... solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework ... parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent...

dynPARTIX
 Referenced in 1 article
[sw30435]
 abstract argumentation which is based on decomposition and dynamic programming. This work is motivated ... makes use of the graphparameter treewidth, which measures the ”treelikeness ... certain decompositions of graphs, socalled treedecompositions. The theoretical results in [1, 3] describe ... which includes heuristic methods to obtain tree decompositions, provides an interface to run algorithms...

SATe
 Referenced in 3 articles
[sw24610]
 divided into smaller subproblems by a treebased decomposition. These subproblems are aligned and further...

Decogo
 Referenced in 5 articles
[sw32747]
 Decompositionbased inner and outerrefinement algorithms for global optimization. Traditional deterministic global optimization methods ... branchandbound (BB) search tree, which may grow rapidly, preventing the method to find ... good solution. Motivated by decompositionbased inner approximation (column generation) methods for solving transport scheduling ... global) BB search tree. We present preliminary numerical results with Decogo (decompositionbased global optimizer...

SuperTriplets
 Referenced in 3 articles
[sw29604]
 whereby a binary representation of the initial trees is first inferred and then a maximum ... This binary representation uses a decomposition of all source trees that is usually based...

treeQP
 Referenced in 3 articles
[sw25622]
 strategy based on scenario decomposition; Dual Newton strategy on tree formulation; Interfaces to HPMPC & HPIPM...

TREE
 Referenced in 2 articles
[sw03080]
 body problems. We have developed a parallel TREE code for twocomponent classical plasmas with ... requiring millions of time steps. Appropriate domain decomposition and dynamic data management were employed ... level of granularity of domain decomposition and ghost TREE communication. Even though the computational load...

REBOUND
 Referenced in 3 articles
[sw27308]
 conditions. REBOUND can use a BarnesHut tree to calculate both selfgravity and collisions ... static domain decomposition and a distributed essential tree. Two new collision detection modules based...

SAMURAI
 Referenced in 28 articles
[sw09145]
 regularization scheme. It is based on the decomposition of the integrand according ... Feynman diagrams or as product of treelevel amplitudes. We discuss some applications, among which...