Acceso al sitio web del Consejo de Políticas de Infraestructura
 

4   Artículos

  Buscar Revistas

 
en línea
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi and Yung-Fa Huang    
Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung    
A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete. However, they are still open for s... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »