• AutoGraphiX

  • Referenced in 123 articles [sw06137]
  • search for extremal graphs, i.e., graphs minimizing of maximizing a graph invariant (or a function ... graph invariants, which could also be considered as an invariant). From this ... main capability, some information on the extremal graphs could be extracted and conjectures...
  • GraPHedron

  • Referenced in 15 articles [sw25129]
  • GraPHedron. Interactive and Automated Conjectures in Extremal Graph Theory. GraPHedron is a conjecture-making system ... designed to help researchers in (extremal) graph theory. GraPHedron is the contraction of the words ... graphs as points in a space of selected invariants, in order to derive extremal properties...
  • JOSTLE

  • Referenced in 32 articles [sw04985]
  • state-of-the-art graph partitioning techniques. The code is extremely fast and provides high...
  • ILUT

  • Referenced in 124 articles [sw08734]
  • each fill-in element using only the graph of the matrix. Then each fill ... propose is a compromise between these two extremes...
  • TADD

  • Referenced in 6 articles [sw02821]
  • topological consistency of the computed extremal structure. Using a graph theoretical formulation of this theory ... algorithmic pipeline that computes a hierarchy of extremal structures. This hierarchy is defined...
  • GADAR

  • Referenced in 2 articles [sw03266]
  • software GADAR and its application to extremal graph theory For the class of algebraically defined...
  • CAPTools

  • Referenced in 7 articles [sw17993]
  • knowledge to build an extremely comprehensive and accurate dependence graph. The initial version has been...
  • SIGNAL

  • Referenced in 50 articles [sw02915]
  • very high-level specification and an extremely modular implementation of complex systems by structurally decomposing ... SIGNAL, the notion of conditional data-flow graph can similarly be used for separately compiling...
  • Kavosh

  • Referenced in 7 articles [sw29733]
  • Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than ... Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption ... based on counting all k-size sub-graphs of a given graph (directed or undirected...
  • GOLEM

  • Referenced in 3 articles [sw20340]
  • GOLEM: an interactive graph-based gene-ontology navigation and analysis tool. BACKGROUND: The Gene Ontology ... become an extremely useful tool for the analysis of genomic data and structuring of biological ... existing system provides an interactively expandable graph-based view of the gene ontology hierarchy. Furthermore...
  • TorchLight

  • Referenced in 4 articles [sw13534]
  • search: on the connection between causal graphs and h+ . The ignoring delete lists relaxation ... exponential runtime and succeeds only in two extremely simple benchmark domains -- we herein answer this ... affirmative. We establish connections between causal graph structure and $h+$ topology. This results...
  • DoQO

  • Referenced in 1 article [sw08906]
  • graphs. In the study of quantum mechanical systems, exact diagonalisation (ED) methods play an extremely ... particles with many body interactions on arbitrary graphs using massively parallel distributed memory machines...
  • GraphBIG

  • Referenced in 1 article [sw23924]
  • System G project. To cover major graph computation types and data sources, GraphBIG selects representative ... characterized GraphBIG on real machines and observed extremely irregular memory patterns and significant diverse behavior ... helps users understand the impact of modern graph computing on the hardware architecture and enables...
  • ARGENT

  • Referenced in 3 articles [sw03148]
  • some site (vertex or edge) of a graph representing the reaction in some generalized ... strong, and weak conditions during generation. The extremely high performance of the suggested algorithm...
  • Parsl

  • Referenced in 2 articles [sw28682]
  • allow Parsl to construct a dynamic dependency graph of components that it can then execute ... such as low-latency, high-throughput, or extreme-scale execution. We show, via experiments...
  • AnnexML

  • Referenced in 1 article [sw30153]
  • Neighbor Search for Extreme Multi-label Classification. Extreme multi-label classification methods have been widely ... this paper, we present a novel graph embedding method called ”AnnexML”. At the training step...
  • NETAL

  • Referenced in 2 articles [sw06628]
  • memory hierarchy in a computer; it targets extremely important kernel types called shortest paths ... pairs shortest paths for the weighted graph USA-road-d.NY.gr ($n =264K, m =734K$), our implementation solved...
  • FlipCut

  • Referenced in 2 articles [sw08374]
  • combines the computation of minimum cuts from graph-based methods with a matrix representation method ... evaluation, we show that our method is extremely swift in practice, and orders of magnitude...
  • CNFgen

  • Referenced in 1 article [sw21968]
  • instances that are theoretically easy but “extremal” in different ways, and therefore of potential interest ... studied in proof complexity are based on graphs, and CNFgen is also able to generate...
  • CppMem

  • Referenced in 1 article [sw27822]
  • graph and annotates these graphs with additional details. The very accurate analysis of CppMem gives ... give you the whole details to the extremely challenging topic and is highly configurable...