An algorithm to find a minimum feedback vertex set of an interval graph

zbMATH Open1161.90515MaRDI QIDQ3539484FDOQ3539484

Authors: Anita Saha, Madhumangal Pal 

Publication date: 18 November 2008

Full work available at URL: http://www.ici.ro/camo/journal/v7n1.htm

Recommendations

• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• Minimum weight feedback vertex sets in circle graphs
• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• Efficient algorithm for minimum feedback vertex set problem on trapezoid graphs
• Feedback vertex set on cocomparability graphs

zbMATH Keywords

network flowdesign and analysis of algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cited In (8)

• Title not available (Why is that?)
• Minimum weight feedback vertex sets in circle graphs
• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• Efficient algorithm for minimum feedback vertex set problem on trapezoid graphs
• Generalized vertex covering in interval graphs
• \(L(2,1)\)-labeling of interval graphs
• Minimum 2-tuple dominating set of an interval graph

This page was built for publication: An algorithm to find a minimum feedback vertex set of an interval graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539484)