A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

DOI10.22075/IJNAA.2019.4063MaRDI QIDQ5218458zbMATH OpenOpenAlexFDO

Authors

Publication date 4 March 2020

Full work available at URL https://ijnaa.semnan.ac.ir/article_4063_17f403a51f166a173016427ef4cb1f31.pdf

zbMATH Keywords

social networkscellular automatagraph coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Coloring of graphs and hypergraphs (05C15) Cellular automata (computational aspects) (68Q80)

Cites work

• Introduction to algorithms.
• New methods to color the vertices of a graph
• Using tabu search techniques for graph coloring

This page was built for publication: A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

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