Open Access
RAIRO-Oper. Res.
Volume 57, Number 3, May-June 2023
Page(s) 1075 - 1086
Published online 11 May 2023
  • D. Angluin, Local and global properties in networks of processors, in Proc. 12th ACM Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980) 82–93. [Google Scholar]
  • D. Castonguay, E.S. Dias, F.N. Mesquita and J.R. Nascimento, Computing some role assignments of Cartesian product of graphs. RAIRO-Oper. Res. 56 (2022) 115–121. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
  • J. Chalopin, Y. Métivier and W. Zielonka, Election, naming and cellular edge local computations, in International Conference on Graph Transformation (ICGT 2004) (EATCS best paper award), Sep. Italy. Springer (2004) 242–256. [Google Scholar]
  • J. Chalopin, Y. Métivier and W. Zielonka, Local computations in graphs: the case of cellular edge local computations. Fundam. Inf. 74 (2006) 85–114. [Google Scholar]
  • A.R. de Almeida, F. Protti and L. Markenzon, Matching preclusion number in cartesian product of graphs and its application to interconnection networks. ARS Comb. 112 (2013) 193–204. [Google Scholar]
  • M.C. Dourado, Computing role assignments of split graphs. Theor. Comput. Sci. 635 (2016) 74–84. [CrossRef] [Google Scholar]
  • J.E. Dunbar, S.M. Hedetniemi, S. Hedetniemi, D.P. Jacobs, J. Knisely, R. Laskar and D.F. Rall, Fall colorings of graphs. J. Comb. Math. Comb. Comput. 33 (2000) 257–274. [Google Scholar]
  • M.G. Everett and S. Borgatti, Role colouring a graph. Math. Soc. Sci. 21 (1991) 183–188. [CrossRef] [Google Scholar]
  • J. Fiala and D. Paulusma, A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349 (2005) 67–81. [CrossRef] [Google Scholar]
  • J. Fiala and D. Paulusma, Comparing universal covers in polynomial time. Theory Comput. Syst. 46 (2010) 620–635. [CrossRef] [MathSciNet] [Google Scholar]
  • M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York, USA (1979). [Google Scholar]
  • R.H. Hammack, W. Imrich and S. Klavžar, Handbook of Product Graphs. Vol. 2. CRC Press, Boca Raton (2011). [CrossRef] [Google Scholar]
  • P. Heggernes, P. van ’t Hof and D. Paulusma, Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14 (2012) 173–188. [CrossRef] [MathSciNet] [Google Scholar]
  • H. Kaul and C. Mitillos, On graph fall-coloring: existence and constructions. Graphs Comb. 35 (2019) 1633–1646. [CrossRef] [Google Scholar]
  • A. Kaveh and K. Koohestani, Graph products for configuration processing of space structures. Comput. Struct. 86 (2008) 1219–1231. [CrossRef] [Google Scholar]
  • R. Laskar and J. Lyle, Fall colouring of bipartite graphs and cartesian products of graphs. Discrete Appl. Math. 157 (2009) 330–338. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Pekeč and F.S. Roberts, The role assignment model nearly fits most social networks. Math. Soc. Sci. 41 (2001) 275–293. [CrossRef] [Google Scholar]
  • F.S. Roberts and L. Sheng, How hard is it to determine if a graph has a 2-role assignment? Netw. Int. J. 37 (2001) 67–73. [Google Scholar]
  • G. Sabidussi, Graph multiplication. Math. Z. 72 (1959) 446–457. [Google Scholar]
  • P. van ‘t Hof, D. Paulusma and J.M.M. van Rooij, Computing role assignments of chordal graphs. Theor. Comput. Sci. 411 (2010) 3601–3613. [CrossRef] [Google Scholar]
  • Y.-Q. Zhao, W.-L. Feng, H. Li and J.-M. Yang., k-role assignments under some graph operations. J. Hebei Univ Sci. Technol. (2010) 06. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.