Fast algorithms for constrained graph density problems

DOI10.1007/978-3-319-15612-5_2MaRDI QIDQ5176568zbMATH OpenOpenAlexFDO

Authors Venkatesan T. Chakaravarthy, Aditya Pancholi, Sambuddha Roy, Neelima Gupta

Publication date 27 February 2015

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15612-5_2

zbMATH Keywords

core decomposition of a graphmassive graphs

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• On Finding Dense Subgraphs
• Finding Dense Subgraphs with Size Bounds
• scientific article; zbMATH DE number 1670532
• Finding densest \(k\)-connected subgraphs
• A general tractable density concept for graphs

Cited in

(9)

• Efficient and effective community search
• Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
• Finding lasting dense subgraphs
• Finding a dense-core in jellyfish graphs
• Fast algorithms for determining (generalized) core groups in social networks
• Density functions subject to a co-matroid constraint
• Fast approximation for computing the fractional arboricity and extraction of communities of a graph
• Finding a Dense-Core in Jellyfish Graphs
• Algorithms for (0, 1,d)-graphs withdconstrains

This page was built for publication: Fast algorithms for constrained graph density problems

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