(none)

Article View: comp.soft-sys.khoros

Article #973

Back to comp.soft-sys.khoros Previous Next

#973

From: kokaveera raghavarao
Date: Thu, 19 Nov 1992 13:36

33 lines
1459 bytes

Hi!
	Can you help me in solving the following problem on regular polygons.


    I am having a regular polygon with 
               
                     vertices = n
        degree of each vertex = d
 Number of edges in each face = f

 Is there any way to compute the number of vertices that are not adjacent
 on a deterministic machine. I deviced an algorithm to solve the problem
 on a non-deterministic machine which is not that hard. I am curious to
 know if there is a deterministic solution to the above problem. I found
 that this problem has very good application in Neural Networks.

 Is the problem NP-Complete ?

 Thanks
 -Raghav
 
		  

<-------------------------------------------------------------------------->
                                                Koka Veera Raghava Rao
	                                        502 S 12 K
	Idle man's mind	      			#802 
						Lincoln
      is devil's workshop.                      NE - 68508
						Ph (402) 438-5183
						kar@cse.unl.edu
<-------------------------------------------------------------------------->

Technical Details

Message-ID: <41731@pprg.eece.unm.edu.pprg.unm.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!zaphod.mps.ohio-state.edu!moe.ksu.ksu.edu!mimbres.cs.unm.edu!pprg.unm.edu!daemon

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!zaphod.mps.ohio-state.edu!moe.ksu.ksu.edu!mimbres.cs.unm.edu!pprg.unm.edu!daemon
From: kar@cse.unl.edu (kokaveera raghavarao)
Newsgroups: comp.soft-sys.khoros
Subject: (none)
Message-ID: <41731@pprg.eece.unm.edu.pprg.unm.edu>
Date: 19 Nov 92 13:36:16 GMT
Sender: news@pprg.unm.edu
Lines: 35