On finding a cycle basis with a shortest maximal cycle

DOI10.1016/0020-0190(94)00231-MzbMath0875.68685OpenAlexW2086081739MaRDI QIDQ1349748

David Heckerman, Dan Geiger, David Maxwell Chickering

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00231-m

zbMATH Keywords

AlgorithmsAnalysis of algorithmsCombinatorial problemsCoding theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

Counting 2-connected deletion-minors of binary matroids, Testing connectivity of faulty networks in sublinear time, The zoo of tree spanner problems, To Approximate Treewidth, Use Treelength!, RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS, Integral cycle bases for cyclic timetabling, On finding cycle bases and fundamental cycle bases with a shortest maximal cycle

Cites Work

• On cycle bases of a graph
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Algorithms for Generating Fundamental Cycles in a Graph
• On the inherent intractability of certain coding problems (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item