
Coxeter
 Referenced in 23 articles
[sw07827]
 Inverse KazhdanLusztig polynomials; Cells and Wgraphs...

PyCox
 Referenced in 12 articles
[sw09237]
 computing KazhdanLusztig cells and Wgraphs, which works efficiently for all finite groups...

CPGraph
 Referenced in 15 articles
[sw08697]
 concept of Gecode. One view implements a graph as a set of nodes ... w) (see below). Constraints of monomorphism using graph variables and map variables are also provided...

Equator
 Referenced in 31 articles
[sw13158]
 easily transfer the data to graphing software (e.g. Excel). An input variable can be constructed ... with the default values w=1, p=1, k=0, corresponding to x=t. Most...

Blossom V
 Referenced in 28 articles
[sw04780]
 problem: the “variable dual updates” approach of W. Cook and A. Rohe [INFORMS J. Comput ... achieve this by maintaining an auxiliary graph whose nodes correspond to alternating trees...

KoralW
 Referenced in 6 articles
[sw00492]
 YFSWW3 with all background graphs and firstorder corrections to Wpair production...

ModularGraphForms
 Referenced in 8 articles
[sw33906]
 Mathematica Package for Modular Graph Forms. Modular graph forms (MGFs) are a class ... threepoint MGFs of total modular weight w ... w¯≤12, starting from just two wellknown identities for banana graphs. Furthermore, we study...

GraphGen
 Referenced in 3 articles
[sw10284]
 labeled graph α is given in the form W ... degrees of the graph nodes. The program can be used to generate two types...

LoginViSta
 Referenced in 1 article
[sw26310]
 ValeroMora and Forrest W. Young interactive and dynamic graphs...

twheuristic
 Referenced in 4 articles
[sw34759]
 algorithms for computing tree decompositions of graphs are heuristics that compute an elimination order ... paraNPhard and W[1]hard when parameterized by only (k) or (c), respectively...

kNeighborhood
 Referenced in 3 articles
[sw13966]
 influence diagrams. Limited memory influence diagrams are graphbased models that describe decision problems with ... that improves on the current solution is W[1]hard and hence unlikely...

CENTROIDFOLD
 Referenced in 2 articles
[sw17123]
 graph representation. PDF version of the graph representation is also available. For a multiple alignment ... sequence text) or a multiple alignment (CLUSTALW format) into the textarea then click...

solverALL
 Referenced in 2 articles
[sw33799]
 clusters is a standard optimization task in graphbased data clustering. Here, complementing classic work ... show that 2Club Cluster Editing is W[2]hard with respect to the number...

sunflower
 Referenced in 1 article
[sw26329]
 lattice of regular hexagonal bins of width w specified by the user. The user also ... called sunflower, is available to draw these graphs. It can be downloaded from the Statistical...

AGD
 Referenced in 12 articles
[sw00022]
 AGDLibrary: A Library of Algorithms for Graph...

Coq
 Referenced in 1880 articles
[sw00161]
 Coq is a formal proof management system. It...

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

gmp
 Referenced in 282 articles
[sw00363]
 GMP is a free library for arbitrary precision...

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...