Showing 5 open source projects for "graph algorithm"

View related business solutions
  • Host LLMs in Production With On-Demand GPUs Icon
    Host LLMs in Production With On-Demand GPUs

    NVIDIA L4 GPUs. 5-second cold starts. Scale to zero when idle.

    Deploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
    Start Free
  • Cut Data Warehouse Costs by 54% Icon
    Cut Data Warehouse Costs by 54%

    Easily migrate from Snowflake, Redshift, or Databricks with free tools.

    BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
    Start Free
  • 1
    java-string-similarity

    java-string-similarity

    Implementation of various string similarity and distance algorithms

    ...This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances").
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    EntOpt Layout

    EntOpt Layout

    Relative entropy optimization network layout plugin

    The goal of this project is to implement a graph layout / network visualization algorithm as a Java plugin for Cytoscape (http://cytoscape.org/), using a recently published relative entropy optimization based method, called Unified Data Representation (Kovács IA et al. Sci Rep. 2015). If you are using the plugin, please cite: Ágg B, Császár A, Szalay-Bekő M, Veres DV, Mizsei R, Ferdinandy P, Csermely P and Kovács IA (2019) The EntOptLayout Cytoscape plug-in for the efficient visualization of major protein complexes in protein-protein interaction and signalling networks, Bioinformatics 35(21):4490-4492 https://academic.oup.com/bioinformatics/article/35/21/4490/5475596 Our detailed Tutorial on the use of the plugin: https://suopte.com/entopt_2_1_tutorial_20200518.pdf A video about the version 2.1: http://suopte.com/entopt_2_1_tutorial_video.mp4 Don't hesitate to send any questions, comments or bug reports also to agg.bence {at} med.semmelweis-univ.hu.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    Approximate Subgraph Matching Algorithm

    Approximate Subgraph Matching Algorithm for Dependency Graphs

    The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4

    MbPc Pagerank Simulator

    Testbed for playing with the algorithm "pagerank" of Google

    Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.
    Downloads: 0 This Week
    Last Update:
    See Project
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • 5
    This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next