Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
feedback edge set
Description:
In graph theory, a feedback edge set is a set of edges whose removal makes a graph acyclic.
Primary topic:
Advanced Graph Theory Research (76%)
Related topics:
Advanced Graph Theory Research (76%),
Complexity and Algorithms in Graphs (13%)
OpenAlex ID:
keywords/feedback-edge-set
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
1998
·
G. Even
, J. (Seffi) Naor
, et al.
·
Algorithmica
·
367
Approximating minimum feedback sets and multi-cuts in directed graphs: Extended summary
1995
·
Guy Even
, Joseph Naor
, et al.
·
Lecture notes in computer science
·
103
On tractable cases of Target Set Selection
2012
·
André Nichterlein
, Rolf Niedermeier
, et al.
·
Social Network Analysis and Mining
·
93
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
1998
·
Michel X. Goemans
, David P. Williamson
·
COMBINATORICA
·
70
On Bounded-Degree Vertex Deletion parameterized by treewidth
2011
·
Nadja Betzler
, Robert Bredereck
, et al.
·
Discrete Applied Mathematics
·
62
Monitoring the edges of a graph using distances
2021
·
Florent Foucaud
, Shih-Shun Kao
, et al.
·
Discrete Applied Mathematics
·
49
Monitoring Edge-Geodetic Sets in Graphs
2023
·
Florent Foucaud
, Krishna Narayanan
, et al.
·
Lecture notes in computer science
·
37
PDF
On the complexity of solution extension of optimization problems
2021
·
Katrin Casel
, Henning Fernau
, et al.
·
Theoretical Computer Science
·
37
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
2015
·
Sepp Hartung
, Christian Komusiewicz
, et al.
·
Journal of Graph Algorithms and Applications
·
35
Exact approaches for scaffolding
2015
·
Mathias Weller
, Annie Chateau
, et al.
·
BMC Bioinformatics
·
33
PDF
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
2019
·
Robert Ganian
, Sebastian Ordyniak
·
Algorithmica
·
27
PDF
Feedback edge sets in temporal graphs
2021
·
Roman Haag
, Hendrik Molter
, et al.
·
Discrete Applied Mathematics
·
25
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
2020
·
Matthias Bentert
, Alexander Dittmann
, et al.
·
Journal of Graph Algorithms and Applications
·
25
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
2012
·
Sepp Hartung
, Christian Komusiewicz
, et al.
·
Lecture notes in computer science
·
23
Forbidden minors to graphs with small feedback sets
2001
·
Michael J. Dinneen
, Kevin Cattell
, et al.
·
Discrete Mathematics
·
23
Two-Layer Planarization parameterized by feedback edge set
2013
·
Johannes Uhlmann
, Mathias Weller
·
Theoretical Computer Science
·
19
PDF
On Tractable Cases of Target Set Selection
2010
·
André Nichterlein
, Rolf Niedermeier
, et al.
·
Lecture notes in computer science
·
17
Parameterized complexity of broadcasting in graphs
2024
·
Fedor V. Fomin
, Pierre Fraigniaud
, et al.
·
Theoretical Computer Science
·
16
On the Hardness of Approximating NP Witnesses
2000
·
Uriel Feige
, Michael Langberg
, et al.
·
Lecture notes in computer science
·
14
Parameterized Vertex Integrity Revisited
2024
·
Hanaka, Tesshu
, Lampis, Michael
, et al.
·
arXiv (Cornell University)
·
13
PDF
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
2022
·
Robert Bredereck
, Klaus Heeger
, et al.
·
Information and Computation
·
13
Obstructions to within a few vertices or edges of acyclic
1995
·
Kevin Cattell
, Michael J. Dinneen
, et al.
·
Lecture notes in computer science
·
13
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
2021
·
Ganian, Robert
, Korchemna, Viktoria
·
arXiv (Cornell University)
·
12
PDF
Monitoring the Edges of a Graph Using Distances
2020
·
Florent Foucaud
, Ralf Klasing
, et al.
·
Lecture notes in computer science
·
12
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
2012
·
Nadja Betzler
, Hans L. Bodlaender
, et al.
·
Algorithmica
·
12
Show more works
View as search
Works count:
95
Citation count:
1,125
Year
Topic
Type