5 citations · 5 across the 6 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DM2019
The Longest -paths of -shaped Supergrid Graphs
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
In this paper, we continue the study of the Hamiltonian and longest -paths of supergrid graphs. The Hamiltonian -path of a graph is a Hamiltonian path between any t…
cs.CC2019
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices…
cs.DM2019★ 5 cited
The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
Supergrid graphs contain grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for general supergrid graphs were known to be NP-complet…