Quantum Approach for Vertex Separator Problem in Directed Graphs - Artificial Intelligence Applications and Innovations
Conference Papers Year : 2022

Quantum Approach for Vertex Separator Problem in Directed Graphs

Abstract

The Vertex Separator Problem of a directed graph consists in finding all combinations of vertices which can disconnect the source and the terminal of the graph, these combinations are minimal if they contain only the minimal number of vertices. In this paper, we introduce a new quantum algorithm based on a movement strategy to find these separators in a quantum superposition with linear complexity. Our algorithm has been tested on small directed graphs using a real Quantum Computer made by IBM .
Fichier principal
Vignette du fichier
527511_1_En_40_Chapter.pdf (982.85 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04317191 , version 1 (01-12-2023)

Licence

Identifiers

Cite

Ahmed Zaiou, Younès Bennani, Mohamed Hibti, Basarab Matei. Quantum Approach for Vertex Separator Problem in Directed Graphs. 18th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Jun 2022, Hersonissos, Greece. pp.495-506, ⟨10.1007/978-3-031-08333-4_40⟩. ⟨hal-04317191⟩
40 View
3 Download

Altmetric

Share

More