Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

DOI10.1007/978-3-319-48749-6_13zbMath1486.05223OpenAlexW2542198895MaRDI QIDQ2958312

Andreas Karrenbauer, Ulrik Brandes, Eugenia Holm

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-0-386674

zbMATH Keywords

regularization procedureregular clique

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Core-Periphery Structure in Networks (Revisited) ⋮ An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers

Uses Software

• Ucinet

Cites Work

• Dense and sparse graph partition
• The splittance of a graph
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Linear degree extractors and the inapproximability of max clique and chromatic number
• On Finding Dense Subgraphs
• Core-Periphery Structure in Networks

This page was built for publication: Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks