Efficient algorithms for path partitions

DOI10.1016/0166-218X(90)90070-SzbMath0735.05068MaRDI QIDQ1813975

D. S. Richards, Craig L. Williams

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

path partition problemedge partition problemsalgorithmic proofs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding Euler tours in parallel
• An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours
• Efficient parallel algorithms for edge coloring problems
• A remark on the factor theorems of lovász and tutte
• The NP-Completeness of Edge-Coloring
• The Subgraph Problem

This page was built for publication: Efficient algorithms for path partitions