• Graphs

  • Referenced in 106 articles [sw12277]
  • graph). A so-called preprocessing algorithm may compute certain information (a data structure or index ... index size and the query time. We survey methods for general graphs as well...
  • Fg-index

  • Referenced in 9 articles [sw18892]
  • index: towards verification-free query processing on graph databases. Graphs are prevalently used to model ... problem. In recent years, some effective graph indexes have been proposed to first obtain ... When the query is an infrequent graph, FG-index produces a candidate answer set which ... using the state-of-the-art graph index...
  • snarkhunter

  • Referenced in 20 articles [sw26975]
  • cyclically 4-edge connected cubic graphs with chromatic index 4 and girth at least ... also be used to generate connected cubic graphs and snarks with girth at least...
  • TALE

  • Referenced in 8 articles [sw13844]
  • queries. We propose a novel indexing method that incorporates graph structural information in a hybrid ... technique achieves high pruning power and the index size scales linearly with the database size ... innovative matching paradigm to query large graphs. This technique distinguishes nodes by their importance...
  • STMBench7

  • Referenced in 9 articles [sw08814]
  • structure consists of a set of graphs and indexes intended to be suggestive of many...
  • GADDI

  • Referenced in 6 articles [sw18895]
  • GADDI: distance index based subgraph matching in biological networks. Currently, a huge amount of biological ... data can be naturally represented by graphs, e.g., protein interaction networks, gene ... regulatory networks, etc. The need for indexing large graphs is an urgent research problem ... focuses on indexing a set of small or medium sized database graphs (with only tens...
  • SING

  • Referenced in 5 articles [sw18904]
  • that are isomorphic to a given query graph has practical applications in several fields, from ... subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed ... process. Such systems filter out those graphs which cannot contain the query, and apply ... Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large...
  • SAPPER

  • Referenced in 5 articles [sw18894]
  • SAPPER: subgraph indexing and approximate matching in large graphs. With the emergence of new applications ... large database graph, we investigate the problem of approximate subgraph indexing, i.e., finding the occurrences ... query graph in a large database graph with (possible) missing edges. The SAPPER method ... index, SAPPER takes advantage of pre-generated random spanning trees and a carefully designed graph...
  • SAGA

  • Referenced in 6 articles [sw18905]
  • gaps, node mismatches and graph structural differences. SAGA employs an indexing technique that allows...
  • HPRD

  • Referenced in 2 articles [sw02834]
  • original RDF graph into several sub-graphs. Path index manages frequent RDF path patterns...
  • GraphREL

  • Referenced in 2 articles [sw18897]
  • database is a key issue in many graph-based applications such as drug discovery ... sortedness, proper join ordering and powerful indexing mechanisms. In this paper ... study the problem of indexing and querying graph databases using the relational infrastructure. We propose ... selectivity-aware SQL translation mechanism of sub-graph search queries. Moreover, we carefully exploit existing...
  • qTorch

  • Referenced in 5 articles [sw27767]
  • problem on 3- through 7-regular graphs using the quantum approximate optimization algorithm (QAOA), successfully ... tensor index contractions: one is based on the tree decomposition of the line graph, while...
  • deBGA

  • Referenced in 2 articles [sw30181]
  • Bruijn Graph-based Aligner (deBGA), an innovative graph-based seed-and-extension algorithm to align ... that is organized and indexed using a de Bruijn graph. With its well-handling...
  • Loopedia

  • Referenced in 1 article [sw21497]
  • characterize Feynman graphs are explained here: the Adjacency List and the Nickel Index. Furthermore ... automatic graph generation and the conversion from Adjacency List to Nickel Index...
  • Pykg2vec

  • Referenced in 4 articles [sw30609]
  • educational platform to accelerate research in knowledge graph representation learning. Pykg2vec is built ... also available in the Python Package Index (PyPI...
  • spinebil

  • Referenced in 1 article [sw35473]
  • Pursuit INdex functions through Exploration Based on Interpolated tour paths and Line graphs. spinebil provides...
  • Conley-Morse-Database

  • Referenced in 3 articles [sw30144]
  • dynamical system Grids, Strong Components; Computing “Clutching” graphs for adjacent parameters Tree-based Grid algorithms ... Find structures; Annotating continuation classes with Conley Index information CHomP...
  • TripleBit

  • Referenced in 1 article [sw27337]
  • graph. This motivates us to design a compact storage and index structure in TripleBit. Second...
  • DockerizeMe

  • Referenced in 1 article [sw30228]
  • Python Package Index (PyPI). It then builds Docker specifications using a graph-based inference procedure...
  • brainGraph

  • Referenced in 1 article [sw17068]
  • Data. A set of tools for performing graph theory analysis of brain MRI data ... Freesurfer analysis (cortical thickness, volumes, local gyrification index, surface area), but also works with ... contains a graphical user interface for graph visualization and data exploration...