Sharp bounds for decomposing graphs into edges and triangles.
Adam BlumenthalBernard LidickýYanitsa PehovaFlorian PfenderOleg PikhurkoJan VolecPublished in: Comb. Probab. Comput. (2021)
Keyphrases
- massive graphs
- directed graph
- weighted graph
- undirected graph
- social networks
- community detection
- spanning tree
- reachability queries
- real world graphs
- graph databases
- main memory
- upper bound
- lower bound
- graph matching
- edge weights
- upper and lower bounds
- graph theoretic
- high quality
- sharp edges
- edge detector
- worst case
- edge information
- bipartite graph
- connected components
- confidence bounds
- nodes of a graph
- lower and upper bounds
- graph partitioning
- graph mining
- directed acyclic graph
- graph theory
- error bounds
- data objects
- range images