Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing subset transversals in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing weighted subset transversals in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of non-crossing paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex leafage of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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 the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tractability of optimization problems on \(H\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithm for the Leafage of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding disjoint paths in split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized polynomial kernel for subset feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest path problem has a polynomial solution on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. III. Graph powers and generalized distance domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. II. The feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The leafage of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The separator theorem for rooted directed vertex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex set on graphs of bounded independent set size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex set in chordal and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 16:14, 28 August 2024

scientific article; zbMATH DE number 7823162
Language Label Description Also known as
English
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
scientific article; zbMATH DE number 7823162

    Statements

    Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2024
    0 references
    0 references
    0 references

    Identifiers