Characterization of minimum cycle basis in weighted partial 2-trees

DOI10.1016/J.DAM.2014.05.008zbMath1319.05065arXiv1302.5889OpenAlexW2067642698MaRDI QIDQ491600

N. S. Narayanaswamy, G. Ramakrishna

Publication date: 18 August 2015

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

Full work available at URL: https://arxiv.org/abs/1302.5889

zbMATH Keywords

partial 2-treeslex short cyclesminimum cycle basis

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Minimal cycle bases of outerplanar graphs
• Minimum cycle bases of weighted outerplanar graphs
• Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• Graph minors. II. Algorithmic aspects of tree-width
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
• Minimum cycle bases of Halin graphs
• On Vector Spaces Associated with a Graph

This page was built for publication: Characterization of minimum cycle basis in weighted partial 2-trees