Keyword

NP-hard graph problems

Description: Computational problems involving graphs that are at least as hard as every problem in NP, studied in graph algorithms and complexity theory.
OpenAlex ID: keywords/np-hard-graph-problems
2012 · Jinsoo Lee, Wook-Shin Han, et al. · Proceedings of the VLDB Endowment · 345
2006 · Gottlieb, Jens, Raidl, Günther R, et al. · Lecture notes in computer science · 329
2001 · Wolfgang Espelage, Frank Gurski, et al. · Lecture notes in computer science · 170
1992 · Martin Juvan, Bojan Mohar · Discrete Applied Mathematics · 157
1996 · Zong-Ben Xu, Guo-Qing Hu, et al. · Neural Networks · 121
2007 · V.E. Alekseev, R. Boliac, et al. · Theoretical Computer Science · 100
2015 · Robert Ganian · Discrete Mathematics & Theoretical Computer Science · 87
2011 · Christoph Ambühl, Monaldo Mastrolilli, et al. · SIAM Journal on Computing · 85
2003 · Vadim Lozin, Dieter Rautenbach · Information Processing Letters · 78
1993 · Jan Arne Telle, Andrzej Proskurowski · Lecture notes in computer science · 77
2012 · Robert Ganian · Lecture notes in computer science · 75
2004 · V. Lozin, D. Rautenbach · SIAM Journal on Discrete Mathematics · 73
2013 · Bart M. P. Jansen · Utrecht University Repository (Utrecht University) · 72
1984 · Yuri Gurevich, Larry Stockmeyer, et al. · Journal of the ACM · 72
2023 · Chengzhi Piao, Tingyang Xu, et al. · Proceedings of the VLDB Endowment · 68
2012 · Abraham Duarte, Laureano F. Escudero, et al. · Computers & Operations Research · 65
2005 · Illya V. Hicks, Arie M. C. A. Koster, et al. · 63
2009 · Falk Hüffner, Nadja Betzler, et al. · Journal of Combinatorial Optimization · 62
2019 · Samin Aref, Andrew J. Mason, et al. · Networks · 59
2009 · Binh-Minh Bui-Xuan, Jan Arne Telle, et al. · Discrete Applied Mathematics · 55
2003 · Jochen Alber, Henning Fernau, et al. · Journal of Computer and System Sciences · 51
2016 · Frank Gurski · Theory of Computing Systems · 49
2015 · S. Mahmoudzadeh, D. Powers, et al. · IEEE International Symposium on Robotics and Intelligent Sensors (IRIS) · 43
2004 · Vladimir E Alekseev, Dmitry V Korobitsyn, et al. · Discrete Mathematics · 43
2005 · Illya V. Hicks · INFORMS journal on computing · 41
Works count: 273
Citation count: 3,858
Year
Topic
Type