pith. sign in

Title resolution pending

Shuichi Ueno, Yoji Kajitani, Shin’ya Gotoh · 1988 · DOI 10.1016/0012-365x(88)90226-9

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Feedback Set Problems on Bounded-Degree (Planar) Graphs

cs.CC · 2026-05-12 · unverdicted · novelty 6.0

Feedback vertex set and feedback edge set are NP-complete on directed graphs of maximum degree 3; on planar digraphs, feedback vertex set is polynomial-time solvable if every vertex has indegree at most 1 or outdegree at most 1 and NP-complete otherwise, with tight degree bounds also given for the 3

citing papers explorer

Showing 1 of 1 citing paper.

  • Feedback Set Problems on Bounded-Degree (Planar) Graphs cs.CC · 2026-05-12 · unverdicted · none · ref 18

    Feedback vertex set and feedback edge set are NP-complete on directed graphs of maximum degree 3; on planar digraphs, feedback vertex set is polynomial-time solvable if every vertex has indegree at most 1 or outdegree at most 1 and NP-complete otherwise, with tight degree bounds also given for the 3