WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. SIAM Journal on Computing (SMJCAT)
  2. Volume 45
  3. Volume 45 Issue 2 (Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013))
  4. Decompositions of Triangle-Dense Graphs
Loading...

Please wait, while we are loading the content...

Volume 47
Volume 46
Volume 45
Volume 45 Issue 6
Volume 45 Issue 5
Volume 45 Issue 4 (Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012))
Volume 45 Issue 3 (Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013))
Volume 45 Issue 2 (Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013))
Superlinear Advantage for Exact Quantum Algorithms
The Geometry of Differential Privacy: The Small Database and Approximate Cases
Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs
Approximating $k$-Median via Pseudo-Approximation
Natural Proofs versus Derandomization
Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard
An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013)
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects
A $c^k n$ 5-Approximation Algorithm for Treewidth
Complexity Classification of Local Hamiltonian Problems
Equilibria in Online Games
Pricing on Paths: A PTAS for the Highway Problem
Decompositions of Triangle-Dense Graphs
Volume 45 Issue 1
Volume 44
Volume 43
Volume 42
Volume 41
Volume 40
Volume 39
Volume 38
Volume 37
Volume 36
Volume 35
Volume 34
Volume 33
Volume 32
Volume 31
Volume 30
Volume 29
Volume 28
Volume 27
Volume 26
Volume 25
Volume 24
Volume 23
Volume 22
Volume 21
Volume 20
Volume 19
Volume 18
Volume 17
Volume 16
Volume 15
Volume 14
Volume 13
Volume 12
Volume 11
Volume 10
Volume 9
Volume 8
Volume 7
Volume 6
Volume 5
Volume 4
Volume 3
Volume 2
Volume 1

Similar Documents

...
Decompositions of triangle-dense graphs

Article

...
Decompositions of Triangle-Dense Graphs

Article

...
Decompositions of triangle-dense graphs (2014)

Article

...
Decompositions of triangle-dense graphs (2014)

Proceeding

...
Interactive Visualization of Small World Graphs

Article

...
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs

Article

...
Counting Triangles in Massive Graphs with MapReduce

Article

...
Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs

Article

...
Triangle Decompositions of Planar Graphs

Article

Decompositions of Triangle-Dense Graphs

Content Provider Society for Industrial and Applied Mathematics (SIAM)
Author Seshadhri, C. Gupta, Rishi Roughgarden, Tim
Copyright Year 2016
Abstract High triangle density---the graph property stating that a constant fraction of two-hop paths belongs to a triangle---is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove constructively that significant portions of a triangle-dense graph are contained in a disjoint union of dense, radius $2$ subgraphs. This result quantifies the extent to which triangle-dense graphs resemble unions of cliques. We also show that our algorithm recovers planted clusterings in approximation-stable $k$-median instances.
Starting Page 197
Ending Page 215
Page Count 19
File Format PDF
ISSN 00975397
DOI 10.1137/140955331
e-ISSN 10957111
Journal SIAM Journal on Computing (SMJCAT)
Issue Number 2 (Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013))
Volume Number 45
Language English
Publisher Society for Industrial and Applied Mathematics
Publisher Date 2016-03-01
Access Restriction Subscribed
Subject Keyword Social networks clustering Graph algorithms social and information networks graph algorithms
Content Type Text
Resource Type Article
Subject Mathematics Computer Science
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...