Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete?

For example, restricted version in the sense that a planar graph be considered instead of a general graph.

I know that we can use Dilworth's theorem to solve it If the DAG represented a partially ordered set, But what about general DAGs

I can't find the answer through googling, so here goes: I would think that attacking (finding a pre-image of) a hash digest would be NP complete in one sense: it's easy to very a hash inversion (putting it in NP), but difficult to find that pre-image...

I'm trying to determine if there is a way of determining wether or not a problem space is "convex" or not, which (as far as I can tell) is equivalent to asking how to determine the stable marriage condition. The problem with using a lineair...

Does P=NP? I have a theory and I would like your opinion Mathtalk? P=NP For definition and details on the problem see: http://www.claymath.org/Millennium_Prize_Problems/P_vs_NP The solution is if I want to compress data, I can take an arbitrary amount...

I'm currently 34 years old, I graduated from a British university in 1997 with a bachleor's degree in Economics and for the last 14 years I've been working in banking/finance. I was hoping to return to university to study a second bachleor's degree this...

Is there a problem whose class is neither P nor NP? Related question: 1) If the answer is 'Yes', is that because P is NP 'complemented'?

It appears that Mises has been proven correct in regards to the calculation problem for communists, that the government, or anyone else for that matter, is unable to properly set prices and quantities of goods to reflect consumer demand, because value...

hi friends this is preethi, i would like to help my friend..but i could not solve his problem..i am looking experts to solve his problem... his problem is still in a career confusion...the folloing problem has to be solved plz help me to help him I am...