Cartesian graph factorization at logarithmic cost per edge
type: Item
instance of: scholarly article
title: Cartesian graph factorization at logarithmic cost per edge
zbMATH Open document ID: 0770.68064
DOI: 10.1007/BF01200428
published in: Computational Complexity
publication date: 1993-08-08T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 179058
zbMATH Keywords: Cartesian product graphs
zbMATH Keywords: factorization
author: Franz Aurenhammer
author: Johann Hagauer
author: Wilfried Imrich
MaRDI profile type: Publication
Wikidata QID: Q56688307
cites work: Computing equivalence classes among the edges of a graph with applications
cites work: Product graph representations
cites work: Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
cites work: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
cites work: Q3684121
cites work: On Isometric Embeddings of Graphs
cites work: A note on Winkler's algorithm for factoring a connected graph
cites work: Graph multiplication
cites work: Factoring a graph in polynomial time
full work available at URL: https://doi.org/10.1007/bf01200428
OpenAlex ID: W1992112020
description: scientific article; zbMATH DE number 179058