• TSSOS

  • Referenced in 13 articles [sw36859]
  • connected components of certain adjacency graphs. The graphs are related to the terms arising...
  • gRbase

  • Referenced in 15 articles [sw10198]
  • graph algorithms (based mainly on representing graphs as adjacency matrices - either in the form ... standard matrix or a sparse matrix). Some graph algorithms are: (i) maximum cardinality search...
  • BootCMatch

  • Referenced in 10 articles [sw27182]
  • software package for bootstrap AMG based on graph weighted matching. This article has two main ... maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum...
  • Colibri

  • Referenced in 9 articles [sw12043]
  • rank approximations of the adjacency matrix of a graph are essential in finding patterns (such...
  • MATLANG

  • Referenced in 5 articles [sw39112]
  • long tradition in understanding graphs by investigating their adjacency matrices by means of linear algebra ... characterising the equivalence of graphs, represented by their adjacency matrices, for various fragments of MATLANG ... graphs cannot be distinguished by posing queries in MATLANG on their adjacency matrices. Surprisingly ... MATLANG on their ability to distinguish graphs. Interestingly, these characterisations can often be phrased...
  • BBMCSP

  • Referenced in 10 articles [sw17718]
  • BBMCSP, designed for large and massive sparse graphs which appear frequently in real life problems ... encode the adjacency matrix in full but when dealing with sparse graphs some form ... employs a novel sparse encoding for the adjacency matrix. Moreover, it also improves on recent...
  • ZAME

  • Referenced in 2 articles [sw27738]
  • ZAME: Interactive Large-Scale Graph Visualization. We present the zoomable adjacency matrix explorer (ZAME ... visualization tool for exploring graphs at a scale of millions of nodes ... edges. ZAME is based on an adjacency matrix graph representation aggregated at multiple scales...
  • GraphBLAS

  • Referenced in 3 articles [sw15657]
  • represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices ... manipulate a very wide range of graphs. This composability of small number of operations...
  • Conley-Morse-Database

  • Referenced in 3 articles [sw30144]
  • system Grids, Strong Components; Computing “Clutching” graphs for adjacent parameters Tree-based Grid algorithms; Learning...
  • qwViz

  • Referenced in 3 articles [sw27609]
  • graphs when provided with the adjacency matrix of the graph. For more detailed studies, qwViz...
  • GADAR

  • Referenced in 2 articles [sw03266]
  • algebraically defined graphs -- i.e., graphs in which adjacency between vertices is defined by some algebraic ... inefficient. GADAR (short for “Graphs with Algebraically Defined Adjacency Relations”) is a package based ... investigation of the infinite families of graphs...
  • Loopedia

  • Referenced in 3 articles [sw21497]
  • ways to characterize Feynman graphs are explained here: the Adjacency List and the Nickel Index ... allows for automatic graph generation and the conversion from Adjacency List to Nickel Index...
  • PyGSP

  • Referenced in 4 articles [sw22598]
  • easily use a custom graph by defining its adjacency matrix, and a custom filter bank...
  • CPGraph

  • Referenced in 15 articles [sw08697]
  • concept of Gecode. One view implements a graph as a set of nodes ... nodes and N sets of adjacent nodes. Some constraints are also provided. The current constraints ... below). Constraints of monomorphism using graph variables and map variables are also provided...
  • bvgraph

  • Referenced in 1 article [sw15019]
  • bvgraph class makes working with enormous graph adjacency matrices in Matlab a snap. The class...
  • PLEXUS

  • Referenced in 1 article [sw02119]
  • concerns usually defined graphs represented by adjacency lists. Graphs are allowed to be undirected, directed...
  • brainwaver

  • Referenced in 2 articles [sw26203]
  • series with a visualisation and parametrisation using graph theory. This package computes the correlation matrix ... order to construct an adjacency matrix of a graph. The graph obtained is finally analysed...
  • SDLNewick

  • Referenced in 1 article [sw30275]
  • Efficiently inferring pairwise subtree prune-and-regraft adjacencies between phylogenetic trees. We develop a time ... construct the subtree prune-regraft (SPR) graph on a collection of (m) phylogenetic trees with ... tree bisection-and-reconnection (TBR) graphs. These new algorithms are enabled by a change ... forests.” Indeed, two trees are adjacent in the graph if, and only if, they share...
  • AFContainer

  • Referenced in 1 article [sw30276]
  • Efficiently inferring pairwise subtree prune-and-regraft adjacencies between phylogenetic trees. We develop a time ... construct the subtree prune-regraft (SPR) graph on a collection of (m) phylogenetic trees with ... tree bisection-and-reconnection (TBR) graphs. These new algorithms are enabled by a change ... forests.” Indeed, two trees are adjacent in the graph if, and only if, they share...
  • NodeSketch

  • Referenced in 1 article [sw32346]
  • sketching the self-loop-augmented adjacency matrix of the graph to output low-order node ... embeddings based on the self-loop-augmented adjacency matrix and (k-1)-order node embeddings ... techniques using five real-world graphs on two graph analysis tasks. The results show that...