An Average Case NP-complete Graph Colouring Problem
نویسندگان
چکیده
منابع مشابه
An Average Case NP-complete Graph Problem
NP-complete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under any samplable (i.e. generateable in polynomial time) distribution a...
متن کاملAn Average Case NP-Complete Graph Coloring Problem
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under all samplable (i.e., generatable in polynomial time) distributions ...
متن کاملThe Graph Genus Problem is NP-Complete
The genus g(G) of a graph G is the smallest number g such that G can be embedded on the orientable surface of genus g. Given a graph G and a natural number k one may ask: Is g(G) I k? This problem, called the graph genus problem, is one of the remaining basic open problems, listed by Garey and Johnson 121, for which there is neither a polynomially bounded algorithm nor a proof that the problem ...
متن کاملSystem Design Is an NP-Complete Problem
The system design process translates the customers’ needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system’s performance and cost goals. This paper proves that the System Design Problem is NP-complete by red...
متن کاملAn NP-Complete Problem in Grid Coloring
A c-coloring of Gn,m = [n] × [m] is a mapping of Gn,m into [c] such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the internet to find a 4-coloring of G17,17. This attracted considerable attention from the popular mathematics community. A coloring was produced; however, finding it proved to be difficult. The question arises: is the problem of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2018
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548318000123