The following pages link to (Q5501266):
Displaying 7 items.
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication (Q2833530) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
