Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912274192531456 |
|---|---|
| author | Shook, James M. Beichl, Isabel |
| author_facet | Shook, James M. Beichl, Isabel |
| contents | For a digraph $G$, a set $F\subseteq V(G)$ is said to be a feedback vertex set (FVS) if $G-F$ is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scaling technique for finding feedback vertex sets in un-weighted directed graphs that runs in $O(|F|\log(|V|)|V|^{2})$ time. Our technique is empirically shown to produce smaller feedback vertex sets than other known heuristics and in a shorter amount of time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10780 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem Shook, James M. Beichl, Isabel Data Structures and Algorithms Discrete Mathematics Combinatorics For a digraph $G$, a set $F\subseteq V(G)$ is said to be a feedback vertex set (FVS) if $G-F$ is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scaling technique for finding feedback vertex sets in un-weighted directed graphs that runs in $O(|F|\log(|V|)|V|^{2})$ time. Our technique is empirically shown to produce smaller feedback vertex sets than other known heuristics and in a shorter amount of time. |
| title | Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem |
| topic | Data Structures and Algorithms Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2503.10780 |