Partitioning a graph in \(O(|A|\log_ 2|V|)\)
type: Item
instance of: scholarly article
title: Partitioning a graph in \(O(|A|\log_ 2|V|)\)
zbMATH Open document ID: 0478.68067
DOI: 10.1016/0304-3975(82)90016-0
author: S. Singh
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3752243
Wikidata QID: Q61677993
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90016-0
OpenAlex ID: W2002279082
cites work: On the computational power of pushdown automata
cites work: An Efficient Algorithm for Graph Isomorphism
cites work: Q4045961
cites work: Q5525259
cites work: The graph isomorphism disease
DBLP publication ID: journals/tcs/CardonC82
description: scientific article; zbMATH DE number 3752243