Cardinality constrained path covering problems in grid graphs
type: Item
instance of: scholarly article
title: Cardinality constrained path covering problems in grid graphs
zbMATH Open document ID: 1055.90083
published in: Networks
publication date: 2005-01-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2126529
zbMATH Keywords: Graphs
zbMATH Keywords: grids
zbMATH Keywords: path covering
zbMATH Keywords: algorithms
zbMATH Keywords: complexity
author: Nicola Apollonio
author: Louis Caccetta
author: Bruno Simeone
MaRDI profile type: MaRDI publication profile
full work available at URL: net.20022
OpenAlex ID: W2000147527
cites work: Q4263699
cites work: Q3760547
cites work: Q4286721
DOI: 10.1002/NET.20022
Recommended article: Covering Paths and Trees for Planar Grids
Recommended article: On the computational complexity of path cover problems
Recommended article: On the isometric path partition problem
Recommended article: Hamiltonian paths in some classes of grid graphs
Recommended article: Hamiltonian paths in \(L\)-shaped grid graphs
description: scientific article; zbMATH DE number 2126529