2012Journal of Combinatorial Theory Series BOpen access

Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem

Ken‐ichi Kawarabayashi, Yusuke Kobayashi

Open full text 43 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 43 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Feedback vertex set, Feedback arc set, Parameterized complexity, Vertex (graph theory), Combinatorics, Disjoint sets, Mathematics, Packing problems

Related papers

Back to paper searchBrowse research topicsOriginal source
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem — Research Paper | ScholarLens