Approximating Partially Bounded Degree Deletion on Directed Graphs

DOI10.7155/jgaa.00511zbMath1427.05096MaRDI QIDQ5240368

Toshihiro Fujito, Kei Kimura, Yuki Mizuno

Publication date: 25 October 2019

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00511

zbMATH Keywords

bounded degree deletion problem; partial bounded degree deletion

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C20: Directed graphs (digraphs), tournaments

05C07: Vertex degrees