Tailored vertex ordering for faster triangle listing in large graphs.
Fabrice LécuyerLouis JachietClémence MagnienLionel TabourierPublished in: ALENEX (2023)
Keyphrases
- directed graph
- attributed graphs
- labeled graphs
- undirected graph
- graph clustering
- connected subgraphs
- hamiltonian cycle
- random graphs
- maximum cardinality
- random walk
- graph matching
- graph theoretic
- neural network
- strongly connected
- memory efficient
- graph partitioning
- graph representation
- graph structures
- data sets
- graph structure
- partial ordering
- triangle mesh
- vertex set
- structured objects
- edge weights
- search engine