Scholars Central

Search Scholars Central

Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.

Advanced searchHide advanced search

In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:

Years

1–25 of 49 articles for NP-Hard problems

Then save them, add them to a collection or cite them together.
  1. Research article · Jan 2014

    Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time

    International Journal of Innovative Research in Computer and Communication Engineering · Volume 2, Issue 1

    probable delay of a given graph having node(n) and edges (m) is NP-Hard problem. The hardness of the problem doesn‟t impact on the restricted version problem ... solve the problem with the help of applying some…

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels