Solving the undirected feedback vertex set problem by local search

05/01/2014
by   Shao-Meng Qin, et al.
0

An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set (FVS) is a set of vertices intersecting with each of these cycles. Constructing a FVS of cardinality approaching the global minimum value is a optimization problem in the nondeterministic polynomial-complete complexity class, therefore it might be extremely difficult for some large graph instances. In this paper we develop a simulated annealing local search algorithm for the undirected FVS problem. By defining an order for the vertices outside the FVS, we replace the global cycle constraints by a set of local vertex constraints on this order. Under these local constraints the cardinality of the focal FVS is then gradually reduced by the simulated annealing dynamical process. We test this heuristic algorithm on large instances of Erödos-Renyi random graph and regular random graph, and find that this algorithm is comparable in performance to the belief propagation-guided decimation algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2018

Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs

Given an undirected graph, the Feedback Vertex Set (FVS) problem asks fo...
research
07/25/2023

A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem

Given a graph, the minimum dominating set (MinDS) problem is to identify...
research
04/24/2019

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs

This paper proposes a local search algorithm for a specific combinatoria...
research
02/27/2019

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem

We present a polynomial complexity, deterministic, heuristic for solving...
research
08/23/2023

RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching

The Ramsey number is the minimum number of nodes, n = R(s, t), such that...
research
10/12/2021

Cycle-Tree Guided Attack of Random K-Core

The K-core of a graph is the maximal subgraph within which each vertex i...
research
04/20/2011

Palette-colouring: a belief-propagation approach

We consider a variation of the prototype combinatorial-optimisation prob...

Please sign up or login with your details

Forgot password? Click here to reset