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

Brandes, Ulrik; Holm, Eugenia; Karrenbauer, Andreas

doi:10.1007/978-3-319-48749-6_13

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2400696_2

DetailsSummary

Released

Conference Paper

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

MPS-Authors

/persons/resource/persons44737

Karrenbauer, Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Brandes, U., Holm, E., & Karrenbauer, A. (2016). Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. In T.-H.-H. Chan, M. Li, & L. Wang (Eds.), Combinatorial Optimization and Applications (pp. 175-186). New York, NY: Springer. doi:10.1007/978-3-319-48749-6_13.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-832D-8

Abstract

There is no abstract available