Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
type: Item
instance of: scholarly article
title: Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
zbMATH Open document ID: 1386.93196
author: Peng Zhang
published in: Discrete Event Dynamic Systems
publication date: 2017-12-18T00:00:00Z
Mathematics Subject Classification ID: 93C65
Mathematics Subject Classification ID: 93C40
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6819725
zbMATH Keywords: adaptive Petri net
zbMATH Keywords: learning automata
zbMATH Keywords: cellular algorithm
zbMATH Keywords: graph-based problems
zbMATH Keywords: vertex coloring (VC) problem
MaRDI profile type: Publication
full work available at URL: s10626-017-0251-z
OpenAlex ID: W2725960764
cites work: A NEW APPROACH TO THE VERTEX COLORING PROBLEM
cites work: Q2970217
cites work: An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
cites work: Graph coloring for air traffic flow management
cites work: On the analysis of Petri nets with static priorities
cites work: UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
cites work: Q3319781
cites work: Q4763572
cites work: Q4857375
cites work: Reducibility among Combinatorial Problems
cites work: Locality in Distributed Graph Algorithms
cites work: On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
cites work: An evolutionary approach for bandwidth multicoloring problems
cites work: Q3911403
cites work: Understanding Petri Nets
cites work: The Synthesis Problem
cites work: The graph coloring problem: A neuronal network approach
cites work: A hierarchical system of learning automata that can learn the globally optimal path
cites work: Analysis of Petri nets with a dynamic priority method
DOI: 10.1007/S10626-017-0251-Z
description: scientific article; zbMATH DE number 6819725