### 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: graph algorithms

## 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 Analytical Use Case Benchmark: Wikipedia

As we have already announced in the previous post we would like to share an analytical use case that shows DEX high performance. This time we are taking a look at how DEX responds to some queries performed on a … Continue reading

Posted in DEX
Tagged 10th anniversary wikipedia, benchmark, dex, graph, graph algorithms, graph database, load time, neo4j, pattern, query, size, sparsity-technologies, wikipedia
5 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