Triangle edge deletion on planar glasses-free RGB-digraphs

DOI10.1016/j.tcs.2018.10.034zbMath1425.68319OpenAlexW2901438414MaRDI QIDQ2317352

Dongjing Miao, Zhipeng Cai, Yingshu Li, Jiguo Yu

Publication date: 9 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.034

zbMATH Keywords

NP-complete problemRGB-digraphstriangle edge deletion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Recognizing the tractability in big data computing

Cites Work

• Finding and counting given length cycles
• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• Automated generation of search tree algorithms for hard graphs modification problems
• On Generating Triangle-Free Graphs
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Node-and edge-deletion NP-complete problems

This page was built for publication: Triangle edge deletion on planar glasses-free RGB-digraphs