On computing graph closures
type: Item
instance of: scholarly article
title: On computing graph closures
zbMATH Open document ID: 0672.68030
DOI: 10.1016/0020-0190(89)90082-3
author: Samir Khuller
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
full work available at URL: https://hdl.handle.net/1813/6761
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4100619
zbMATH Keywords: P-completeness
zbMATH Keywords: graphs
zbMATH Keywords: closure
MaRDI profile type: Publication
OpenAlex ID: W2054549596
cites work: Q5422499
cites work: Q4128417
cites work: The maximum flow problem is log space complete for P
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
description: scientific article; zbMATH DE number 4100619