Re: Complexity of graph problems
- From: nathan.gilbert@xxxxxxxxx (Nathan Gilbert)
- Date: 24 Nov 2005 19:19:46 GMT
Michael Schnupp <michas@xxxxxxxxxxxxxx> once said:
> Hi,
>
> I'm working on a project on the computational complexity of some
> special graph problems.
>
> I wonder if there is an overview showing which standard problems
> an NP-hard on which graph classes. (Ideally with an pointer to the proof.)
>
Can anyone give me some information on the general complexity of finding the
dominating set of a graph?
Thanks in advance,
NG
--
"The life of a repoman is always intense."
.
- Follow-Ups:
- Re: Complexity of graph problems
- From: Jaisingh Solanki
- Re: Complexity of graph problems
- Prev by Date: Re: Proof - the right track?
- Next by Date: Re: Complexity of graph problems
- Previous by thread: "Importance" of a node in a graph
- Next by thread: Re: Complexity of graph problems
- Index(es):
Relevant Pages
|