Minimum Path Bases

DOI10.1006/JAGM.1993.1033zbMath0784.68041OpenAlexW1995818744MaRDI QIDQ3141525

David B. Hartvigsen

Publication date: 27 March 1994

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1033

zbMATH Keywords

pathscyclespolynomial algorithmvector spaceminimum weight basisplanar \(k\)-split problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Algorithms for shortest paths and \(d\)-cycle problems ⋮ The planar multiterminal cut problem ⋮ RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS ⋮ An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs

This page was built for publication: Minimum Path Bases