Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time

DOI10.1007/978-3-642-45043-3_20zbMath1417.05203arXiv1303.0728OpenAlexW1586424601MaRDI QIDQ2864304

G. Ramakrishna, Jens M. Schmidt, Carola Doerr

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Characterization of minimum cycle basis in weighted partial 2-trees

This page was built for publication: Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time