A note on computing graph closures
type: Item
instance of: scholarly article
title: A note on computing graph closures
zbMATH Open document ID: 1031.05122
DOI: 10.1016/S0012-365X(03)00316-9
published in: Discrete Mathematics
publication date: 2004-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2041916
zbMATH Keywords: Graph closure
zbMATH Keywords: Algorithm
author: Jeremy P. Spinrad
MaRDI profile type: Publication
cites work: Q4773298
cites work: A method in graph theory
cites work: Closure concepts: A survey
cites work: Independence trees and Hamilton cycles
cites work: Q3136984
cites work: On computing graph closures
cites work: On the computational complexity of graph closures
cites work: Q4694753
cites work: A note on the computation on the k-closure of a graph
cites work: A generalization of the Bondy-Chvátal theorem on the k-closure
description: scientific article; zbMATH DE number 2041916