The Baeldung logo
  • The Baeldung LogoCS SublogoCS Sublogo
  • Start Here
  • Guides ▼▲
    • Core Concepts

      Fundamental concepts in Computer Science

    • Operating Systems

      Learn about the types of OSs used and the basic services they provide.

    • Neural Networks

      Explore the theory behind neural networks and their architecture.

    • Graph Theory

      Learn how GPS systems find the shortest routes, how engineers design integrated circuits and more real-world uses of graphs

    • Latex

      A powerful preparation tool for creating high-quality document.

  • Pricing
  • About ▼▲
    • Full Archive

      The high level overview of all the articles on the site.

    • About Baeldung

      About Baeldung.

  • Category upGraphs
  • Category upGraph Theory
  • Category upPath Finding

Tag: NP-Complete

>> P, NP, NP-Complete and NP-Hard Problems in Computer Science

>> Vertex Coloring in Graphs

>> Constructive Algorithms for Graph Colouring

>> Traveling Salesman Problem: Exact Solutions vs. Heuristic vs. Approximation Algorithms

>> Graph Theory: What Is Vertex Coloring?

>> Traveling Salesman Problem – Dynamic Programming Approach

>> How to Prove That a Problem Is NP-Complete?

>> 0-1 Knapsack: A Problem With NP-Completeness and Solvable in Pseudo-Polynomial Time

The Baeldung logo

Categories

  • Algorithms
  • Artificial Intelligence
  • Core Concepts
  • Data Structures
  • Latex
  • Networking
  • Security

Series

  • Graphs Tutorial
  • Neural Networks Series
  • LaTeX Series

About

  • About Baeldung
  • Baeldung All Access
  • The Full archive
  • Editors
  • Our Partners
  • Partner with Baeldung
  • eBooks
  • FAQ
  • Baeldung Pro
  • Terms of Service
  • Privacy Policy
  • Company Info
  • Contact
The Baeldung Logo