Subset feedback vertex sets in chordal graphs (Q2447531): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q259036
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Petr A. Golovach / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2013.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110960146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Minimal Subset Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Minimal Dominating Sets and Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / 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: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank

Latest revision as of 11:30, 8 July 2024

scientific article
Language Label Description Also known as
English
Subset feedback vertex sets in chordal graphs
scientific article

    Statements

    Subset feedback vertex sets in chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2014
    0 references
    chordal graph
    0 references
    subset feedback vertex set
    0 references
    maximum number of minimal subset feedback vertex sets
    0 references
    exact exponential-time algorithm
    0 references

    Identifiers