On using learning automata for fast graph partitioning

DOI10.1007/3-540-59175-3_109zbMath1495.68181OpenAlexW1597102073MaRDI QIDQ5096351

Edward V. de st. Croix, B. John Oommen

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_109

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
• A class of bounded approximation algorithms for graph partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Using simulated annealing to solve routing and location problems
• Deterministic learning automata solutions to the equipartitioning problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• Graph partitioning using learning automata
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: On using learning automata for fast graph partitioning