Feedback vertex set on cocomparability graphs

DOI10.1002/net.3230260205zbMath0856.90113OpenAlexW2058848621MaRDI QIDQ4894873

C. Pandu Rangan, Satyan Coorg

Publication date: 30 November 2000

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230260205

zbMATH Keywords

cocomparability graphsundirected graphminimum cardinalityfeedback vertex set problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS ⋮ Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT ⋮ Happy set problem on subclasses of co-comparability graphs ⋮ A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs ⋮ Solving the feedback vertex set problem on undirected graphs ⋮ Minimum weight feedback vertex sets in circle graphs ⋮ Happy set problem on subclasses of co-comparability graphs ⋮ Minimum feedback vertex set and acyclic coloring.

Cites Work

• Unnamed Item
• Unnamed Item