Contraction Hierarchies on Grid Graphs

Author(s):  
Sabine Storandt
Keyword(s):  
2021 ◽  
Vol 37 (3) ◽  
pp. 907-917
Author(s):  
Martin Kreh ◽  
Jan-Hendrik de Wiljes

AbstractIn 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. In the same article, the authors proved some results on the solvability of Cartesian products, given solvable or distance 2-solvable graphs. We extend these results to Cartesian products of certain unsolvable graphs. In particular, we prove that ladders and grid graphs are solvable and, further, even the Cartesian product of two stars, which in a sense are the “most” unsolvable graphs.


2012 ◽  
Vol 160 (3) ◽  
pp. 210-217 ◽  
Author(s):  
Fatemeh Keshavarz-Kohjerdi ◽  
Alireza Bagheri ◽  
Asghar Asgharian-Sardroud

Networks ◽  
2009 ◽  
Vol 53 (2) ◽  
pp. 191-205 ◽  
Author(s):  
Ekkehard Köhler ◽  
Christian Liebchen ◽  
Gregor Wünsch ◽  
Romeo Rizzi

1995 ◽  
Vol 41 (3) ◽  
pp. 255-275 ◽  
Author(s):  
Martin Gr�tschel ◽  
Alexander Martin ◽  
Robert Weismantel
Keyword(s):  

Author(s):  
Rahnuma Islam Nishat ◽  
Venkatesh Srinivasan ◽  
Sue Whitesides

2020 ◽  
Vol 17 (1) ◽  
pp. 109-117
Author(s):  
Saad Ihsan Butt ◽  
Muhammad Numan ◽  
Sharafat Ali ◽  
Andrea Semaničová-Feňovčíková
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document