A fast randomized algorithm for partitioning a graph into paths of fixed length
type: Item
instance of: scholarly article
title: A fast randomized algorithm for partitioning a graph into paths of fixed length
zbMATH Open document ID: 0768.68183
DOI: 10.1016/0166-218X(93)90052-P
published in: Discrete Applied Mathematics
publication date: 1993-06-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 221659
zbMATH Keywords: randomized extension-rotation algorithm
zbMATH Keywords: partition
zbMATH Keywords: random graphs
author: L. Stougie
MaRDI profile type: Publication
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Q3267900
cites work: Q5538132
cites work: Q4198056
cites work: Q3703583
cites work: Q3680834
full work available at URL: 0166-218x(93)90052-p
OpenAlex ID: W2102127932
Recommended article: Q3323995
Recommended article: Efficient algorithms for path partitions
Recommended article: An exact algorithm for graph partitioning
Recommended article: Q3323996
Recommended article: Efficient algorithms for some path partitioning problems
Recommended article: Partitioning graphs into paths or cycles of prescribed lengths
Recommended article: On the path partition of graphs
Recommended article: A linear time algorithm for graph partition problems
Recommended article: Partitioning a graph into vertex-disjoint paths
description: scientific article; zbMATH DE number 221659