Your rugby mates don't need to know your colleagues: triadic closure with edge colors

DOI10.1007/978-3-030-17402-6_9zbMath1477.68209arXiv1811.09411OpenAlexW2901587122MaRDI QIDQ5919399

Laurent Bulteau, Niels Grüttemeier, Manuel Sorge, Christian Komusiewicz

Publication date: 6 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.09411

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

On the relation of strong triadic closure and cluster deletion

This page was built for publication: Your rugby mates don't need to know your colleagues: triadic closure with edge colors