On the computational complexity of graph closures
type: Item
instance of: scholarly article
title: On the computational complexity of graph closures
zbMATH Open document ID: 0875.68543
DOI: 10.1016/0020-0190(96)00027-0
author: Angelo Monti
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 984458
zbMATH Keywords: Computational complexity
zbMATH Keywords: Graph closure
zbMATH Keywords: Parallel complexity
zbMATH Keywords: P-completeness
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00027-0
OpenAlex ID: W2015601981
cites work: A method in graph theory
cites work: Q4128417
cites work: The maximum flow problem is log space complete for P
cites work: Q3900091
cites work: Q4385525
cites work: On computing graph closures
Recommended article: On computing graph closures
Recommended article: A note on computing graph closures
Recommended article: On graph closures
Recommended article: A note on the computation on the k-closure of a graph
Recommended article: On a certain complexity estimate in graph theory
Recommended article: Q3481738
Recommended article: On Graph Complexity
Recommended article: Q3341898
Recommended article: A New Algorithm for Computing the Maximal Closure of a Graph
Recommended article: Q5146181
description: scientific article; zbMATH DE number 984458