Minimum Path Bases

DOI10.1006/JAGM.1993.1033MaRDI QIDQ3141525zbMATH OpenOpenAlexFDO

Authors David 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

cyclesminimum weight basispathsplanar \(k\)-split problempolynomial algorithmvector space

Mathematics Subject Classification ID

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

Recommendations

• The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
• Automata, Languages and Programming
• Minimum cycle bases, faster and simpler
• New Approximation Algorithms for Minimum Cycle Bases of Graphs
• Minimum Cycle Bases and Their Applications

Cited in

(7)

• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
• The planar multiterminal cut problem
• Minimum path bases and relevant paths
• scientific article; zbMATH DE number 1341908 (Why is no real title available?)
• The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
• RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
• Algorithms for shortest paths and d-cycle problems

This page was built for publication: Minimum Path Bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141525)