Decompositions of triangle-dense graphs

DOI10.1145/2554797.2554840MaRDI QIDQ6828734zbMATH OpenFDO

Authors Rishi Gupta, Tim Roughgarden, C. Seshadhri

Publication date 19 May 2017

Published in Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)

zbMATH Keywords

clusteringgraph algorithmssocial and information networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

This page was built for publication: Decompositions of triangle-dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828734)