Author:
Abu-Khzam Faisal N.,Langston Michael A.,Mouawad Amer E.,Nolan Clinton P.
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41, 313–324 (2001)
2. Chen, J., Liu, L., Jia, W.: Improvement on vertex cover for low-degree graphs. Networks 35(4), 253–259 (2000)
3. Lecture Notes in Computer Science;L. Engebretsen,2000
4. Lecture Notes in Computer Science;F.V. Fomin,2005
5. Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2
n
. Algorithmica 52(2), 153–166 (2008)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Feature Selection via Independent Domination;2023 Fifth International Conference on Transdisciplinary AI (TransAI);2023-09-25
2. Graph Embedding: A Methodological Survey;2022 Fourth International Conference on Transdisciplinary AI (TransAI);2022-09
3. Learning from obstructions: An effective deep learning approach for minimum vertex cover;Annals of Mathematics and Artificial Intelligence;2022-08-16
4. Parallel Vertex Cover Algorithms on GPUs;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05
5. Anomaly Detection via Correlation Clustering;2022 IEEE 16th International Conference on Semantic Computing (ICSC);2022-01