A polynomial-time OPT ɛ -approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
ACM-SIAM Symposium on Discrete Algorithms(2024)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要
ACM-SIAM Symposium on Discrete Algorithms(2024)