Search Results for "graph algorithm"
Sort By:
Showing 5 open source projects for "graph algorithm"
View related business solutions-
Cloud-based help desk software with ServoDeskWhat if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
-
Total Network Visibility for Network Engineers and IT ManagersThis means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
-
1
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"). -
2
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. -
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). ... -
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. -
Desktop and Mobile Device Management SoftwareDesktop Central is a unified endpoint management (UEM) solution that helps in managing servers, laptops, desktops, smartphones, and tablets from a central location.
-
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.
- Previous
- You're on page 1
- Next
