Recognizing Cartesian products in linear time
type: Item
instance of: scholarly article
title: Recognizing Cartesian products in linear time
zbMATH Open document ID: 1111.05081
author: Wilfried Imrich
author: Iztok Peterin
published in: Discrete Mathematics
publication date: 2007-02-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5124965
zbMATH Keywords: Cartesian product graphs
zbMATH Keywords: linear algorithm
zbMATH Keywords: decomposition
MaRDI profile type: Publication
full work available at URL: j.disc.2005.09.038
OpenAlex ID: W2127749196
Wikidata QID: Q56688309
cites work: Q4773298
cites work: Cartesian graph factorization at logarithmic cost per edge
cites work: Product graph representations
cites work: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
cites work: Q4294601
cites work: Q4523707
cites work: Graph multiplication
cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY
cites work: Factoring a graph in polynomial time
DOI: 10.1016/J.DISC.2005.09.038
Recommended article: Generalized line graphs: Cartesian products and complexity of recognition
Recommended article: Recognizing Cartesian products of matrices and polytopes
Recommended article: Fast Searching on Cartesian Products of Graphs
Recommended article: Fast recognition of partial star products and quasi cartesian products
Recommended article: Recognizing triangulated Cartesian graph products
Recommended article: The fast search number of a Cartesian product of graphs
Recommended article: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Recommended article: Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
Recommended article: Fast recognition of direct and strong products
Recommended article: Q4027599
description: scientific article; zbMATH DE number 5124965