Your rugby mates don't need to know your colleagues: triadic closure with edge colors
DOI10.1016/j.jcss.2021.03.001zbMath1477.68210MaRDI QIDQ5918315
Laurent Bulteau, Christian Komusiewicz, Manuel Sorge, Niels Grüttemeier
Publication date: 30 June 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.03.001
edge coloring; fixed-parameter tractability; exponential time hypothesis; kernelization; social network analysis
68W40: Analysis of algorithms
91D30: Social networks; opinion dynamics
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q27: Parameterized complexity, tractability and kernelization
