Computing some role assignments of Cartesian product of graphs

DOI10.1051/RO/2021192MaRDI QIDQ5034787zbMATH OpenOpenAlexFDO

Authors Diane Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, Julliano Rosa Nascimento

Publication date 21 February 2022

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ro/2021192

zbMATH Keywords

Cartesian productcomputational complexityrole assignment

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social networks; opinion dynamics (91D30)

Recommendations

• Computing role assignments of Cartesian product of graphs
• Computing Role Assignments of Chordal Graphs
• How hard is it to determine if a graph has a 2-role assignment?
• The role assignment model nearly fits most social networks
• Computing role assignments of chordal graphs

Cited in

(7)

• How hard is it to determine if a graph has a 2-role assignment?
• Computing role assignments of split graphs
• Computing Role Assignments of Chordal Graphs
• scientific article; zbMATH DE number 1302393 (Why is no real title available?)
• Computing role assignments of Cartesian product of graphs
• Study on (r+1)-role assignments of complementary prisms, with r 3
• Computing a 3-role assignment is polynomial-time solvable on complementary prisms

This page was built for publication: Computing some role assignments of Cartesian product of graphs

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