Back to Results
First PageMeta Content
NP-complete problems / Graph theory / Network theory / Edsger W. Dijkstra / Shortest path problem / Maximal independent set / Independent set / Matching / Bipartite graph / Degree / Graph / Line graph


On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin KamiĀ“ nski2 , Hirotaka Ono3 , 1 4
Add to Reading List

Document Date: 2014-04-14 14:04:38


Open Document

File Size: 295,82 KB

Share Result on Facebook