On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60488746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the feedback vertex set problem on undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of maximal bipartite subgraphs of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelength Conversion in Optical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy randomized adaptive search procedure for the feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Computation of Maximum Induced Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 20:58, 28 June 2024

scientific article
Language Label Description Also known as
English
On the minimum feedback vertex set problem: Exact and enumeration algorithms
scientific article

    Statements

    On the minimum feedback vertex set problem: Exact and enumeration algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2008
    0 references
    minimum feedback vertex set
    0 references
    maximum induced forest
    0 references
    exact exponential algorithm
    0 references
    number of minimal feedback vertex sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers