Experimental and Efficient Algorithms
From MaRDI portal
(Redirected from Publication:5710065)
Experimental and Efficient Algorithms (scientific article; zbMATH DE number 2234681)
Experimental and Efficient Algorithms (scientific article; zbMATH DE number 2234681)
Recommendations
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Efficient triangle counting in large graphs via degree-based vertex partitioning
- Triangle listing algorithms: back from the diversion
- Efficient triangle counting in large graphs via degree-based vertex partitioning
- Listing triangles
Cited in
(43)- iTri: index-based triangle listing in massive graphs
- Are unique subgraphs not easier to find?
- Efficient algorithms for subgraph listing
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- An efficient exact algorithm for triangle listing in large graphs
- The maximum number of induced open triangles in graphs of a given order
- Impact of structural balance on self-avoiding pruning walk
- Summarized bit batch-based triangle listing in massive graphs
- Fooling views: a new lower bound technique for distributed computations under congestion
- A second look at counting triangles in graph streams (corrected)
- Compact representation of graphs with bounded bandwidth or treedepth
- Counting triangles in massive graphs with MapReduce
- Efficient Computation of the Weighted Clustering Coefficient
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Approximately counting triangles in sublinear time
- Practical minimum cut algorithms
- On the characteristic polynomial of the power of a path
- Why do simple algorithms for triangle enumeration work in the real world?
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- I/O-efficient algorithms on triangle listing and counting
- On approximating the number of k-cliques in sublinear time
- Bounds and algorithms for graph trusses
- A framework for second-order eigenvector centralities and clustering coefficients
- Listing triangles
- Triangle listing algorithms: back from the diversion
- Triangle Finding and Listing in CONGEST Networks
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Detecting and counting small pattern graphs
- Efficient computation of the Weighted Clustering Coefficient
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- On the maximum number of open triangles in graphs with the same number of vertices and edges
- Efficient triangle counting in large graphs via degree-based vertex partitioning
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
- Parallel Discovery of Top-k Weighted Motifs in Large Graphs
- Tailored vertex ordering for faster triangle listing in large graphs
- Discretization orders for distance geometry problems
- On the maximum number of open triangles in graphs with few edges
- On graphs with small number of edges having extremal number of open triangles
- A second look at counting triangles in graph streams
- Complex network filtering and compression algorithm based on triangle-subgraph
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
This page was built for publication: Experimental and Efficient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710065)
