
Jdrasil
 Referenced in 5 articles
[sw25570]
 theoretical aspects concerning the computation of tree width  one of the most important graph parameters...

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

dynPARTIX
 Referenced in 1 article
[sw30435]
 makes use of the graphparameter treewidth, which measures the ”treelikeness ... graph. More specifically, treewidth is defined via certain decompositions of graphs, socalled tree ... performance mainly depends on the treewidth of the given AF, but the running times ... environment which includes heuristic methods to obtain tree decompositions, provides an interface to run algorithms...

SuperIso Relic
 Referenced in 8 articles
[sw09108]
 been generated at the tree level with FeynArts/FormCalc, and widths of the Higgs bosons...

htd
 Referenced in 9 articles
[sw21112]
 taking concrete algorithms that make use of tree decompositions into account. In fact, practical experience ... shown that generating decompositions of small width is not the only crucial ingredient towards efficiency ... efficient implementations of several heuristic approaches for tree decomposition and offers various features for normalization...

measuRing
 Referenced in 1 article
[sw25760]
 package measuRing: Detection and Control of TreeRing Widths on Scanned Image Sections. Identification...

2HDECAY
 Referenced in 2 articles
[sw40158]
 calculation of the partial decay widths and branching ratios of the Higgs bosons ... electroweak contributions to the treelevel partial decay widths for several different renormalization schemes allows...

ToTo
 Referenced in 4 articles
[sw19369]
 tree decomposition of the graph of low (ideally, minimum) width. Unfortunately computation of treewidth ... computation, storage and rapid retrieval of tree decompositions. We hope that the database will become...

twheuristic
 Referenced in 4 articles
[sw34759]
 widely used class of algorithms for computing tree decompositions of graphs are heuristics that compute ... already computed a partial elimination order of width at most (k), but extending...

LUSIFER
 Referenced in 3 articles
[sw40058]
 technique and employs the full set of treelevel diagrams. External fermions are taken ... comparing various ways of introducing decay widths of intermediate top quarks, gauge and Higgs bosons...

SUSY23
 Referenced in 1 article
[sw10788]
 final state particles at tree level are included in version 2.0. SUSY23 addresses event simulation ... sections, then unweighted events are generated. Sparticle widths and decay branching ratios are calculated. Each...

CGAL
 Referenced in 384 articles
[sw00118]
 The goal of the CGAL Open Source Project...

CoCoA
 Referenced in 654 articles
[sw00143]
 CoCoA is a system for Computations in Commutative...

GAP
 Referenced in 3154 articles
[sw00320]
 GAP is a system for computational discrete algebra...

KNITRO
 Referenced in 196 articles
[sw00490]
 KNITRO is a solver for nonlinear optimization. It...

LANCELOT
 Referenced in 306 articles
[sw00500]
 LANCELOT. A Fortran package for largescale nonlinear...

LAPACK
 Referenced in 1695 articles
[sw00503]
 LAPACK is written in Fortran 90 and provides...

Macaulay2
 Referenced in 1904 articles
[sw00537]
 Macaulay2 is a software system devoted to supporting...

Maple
 Referenced in 5363 articles
[sw00545]
 The result of over 30 years of cutting...

Mathematica
 Referenced in 6337 articles
[sw00554]
 Almost any workflow involves computing results, and that...