[algogeeks] Finding dominated elements in sets...

Hallo there, me and my friends are implementing a fixed-parameter algorithm for the 3-HS problem described in http://tinyurl.com/9mdnqj This problem can be seen as vertex cover on hypergraphs. So here's an example: Vertices: {x,y,z,s,t} Hyperedges: {{x,y,z},{z,t,x},{s,t,y},{t,s}} One minimum Set

[algogeeks] CFP: The 2009 International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS'09), USA, July 13-16, 2009

C A L LF O RP A P E R S === CALL FOR PAPERS and Call For Workshop/Session Proposals The 2009 International Conference on Frontiers in Education: