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.
Primary topic: Advanced Graph Theory Research (39%)
OpenAlex ID: keywords/np-hard-graph-problems
