Message:
[
First
|
Previous
Next
Last
]
By Topic:
By Author:
Font:
Proportional Font
LISTSERV Archives
SPACESYNTAX Home
SPACESYNTAX September 2008
Subscribe or Unsubscribe
Log In
Get Password
Subject:
Re: Varieties of visibility graphs
From:
Sanjay Rana <[log in to unmask]>
Reply-To:
[log in to unmask]
Date:
Tue, 9 Sep 2008 09:55:55 +0100
Content-Type:
text/plain
Parts/Attachments:
text/plain (8 lines)
In fact the equivalent graph theory problem is called "Minimum Dominating Set" problem, which is also NP-complete. Does anyone know of benchmark or hard cases that exemplify the NP- complete character of the problem? Thanks.
Top of Message | Previous Page | Permalink
Advanced Options
For help and support help@jisc.ac.uk