Back to Results
First PageMeta Content
Mathematics / Applied mathematics / NP-complete problems / Theoretical computer science / Combinatorial optimization / Matching


Swapping Labeled Tokens on Graphs Katsuhisa Yamanaka1 , Erik D. Demaine2 , Takehiro Ito3 , Jun Kawahara4 , Masashi Kiyomi5 , Yoshio Okamoto6 , Toshiki Saitoh7 , Akira Suzuki3 , Kei Uchizawa8 , and Takeaki Uno9 1
Add to Reading List

Document Date: 2014-03-31 23:30:57

Open Document

File Size: 119,24 KB

Share Result on Facebook

Country

Japan / United States / /

/

Facility

Nara Institute of Science / Yokohama City University / University of Electro-Communications / Iwate University / Kobe University / Massachusetts Institute of Technology / Institute of Informatics / Yamagata University / Tohoku University / /

IndustryTerm

2α-approximation algorithm / interconnection network / primitive sorting network / bubble sort algorithm / parallel sorting algorithm / approximation algorithm / round algorithm / polynomial-time algorithm / polynomial-time 2α-approximation algorithm / /

Organization

Institute of Informatics / Nara Institute of Science and Technology / Iwate University / University of Electro-Communications / Massachusetts Institute of Technology / Tohoku University / Yamagata University / Kobe University / City University / /

Person

D. Then / /

Position

teacher / General / elementary school / /

ProgrammingLanguage

C / /

ProvinceOrState

South Carolina / Massachusetts / /

Technology

round algorithm / three algorithms / polynomial-time 2-approximation algorithm / polynomial-time 2α-approximation algorithm / 2α-approximation algorithm / FPT algorithms / approximation algorithm / polynomial-time algorithm / 2 Massachusetts Institute of Technology / parallel sorting algorithm / bubble sort algorithm / /

SocialTag