-
Research papers
High Quality, Scalable and Parallel Community Detection for Large Real Graphs. Arnau Prat-Pérez, David Dominguez-Sal, Josep-Lluis Larriba-Pey: WWW (2014)-
Recent Posts
Archives
Tag Archives: shortest path
Sparksee 5.2 new release!
We are proud to announce the release of Sparksee 5.2 today! Download your trial on our website or request a license for free. New version includes the following features: The fastest community detection algorithm: We have included the SCD algorithm … Continue reading
Posted in News, Sparksee
Tagged 5.2, Android, community algorithm, shortest path, sparksee, sparksee 5.2, sparksee new release
Comments Off on Sparksee 5.2 new release!
Query Expansion by Exploiting Graph Properties for Image Retrieval
When searching images for a certain query, ambiguity problems may arise. For instance, when searching for the query “colored Volkswagen beetle” the most common search engines would retrieve some images with the famous car, but also the bug and even … Continue reading
Posted in Research
Tagged communities algorithm, community, enrich image retrieval, graph properties, graph research, image retrieval, query expansion, shortest path
Comments Off on Query Expansion by Exploiting Graph Properties for Image Retrieval
How to use DEX algorithm package
The latest version of DEX includes the helpful algorithm package that give more high-level operations to the API. Here you can find the list of algorithms explained including examples of use for the Java and .NET APIs: Traversals algorithms To … Continue reading
Posted in DEX, Documentation
Tagged .net, API methods, bfs, connected components, connectivity, dex, dex 4.5, dfs, Dijkstra, documentation, examples, Gabow, graph algorithms, graph database, high-performance, java, shortest path, sparsity-technologies, traversal
2 Comments
DEX 3.0 features: Graph algorithms
Starting today we are going to make a series of posts explaining the most exciting features of the last available version of DEX. We hope that these explanations will give you a hint on the powerful possibilities of DEX. If … Continue reading
Posted in DEX, Documentation
Tagged bfs, connectivity, dex, dex 3.0, dfs, Dijkstra, features, Gabow, graph algorithms, graph database, shortest path, traversals
7 Comments