Back to Results
First PageMeta Content



Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  
Add to Reading List

Document Date: 2010-08-16 06:33:22


Open Document

File Size: 195,88 KB

Share Result on Facebook

Currency

pence / /

/

Facility

Adam Mickiewicz University / /

IndustryTerm

search version / exhaustive search / polynomial time algorithm / rst polynomial time algorithm / /

Organization

African Union / Faculty of Mathematics and Computer Science / Department of Computer Science / University of Bonn / Adam Mickiewicz University / /

Technology

rst polynomial time algorithm / polynomial time algorithm / main algorithm / required set R. Algorithm / /

SocialTag