Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
From MaRDI portal
Publication:2864304
DOI10.1007/978-3-642-45043-3_20zbMath1417.05203arXiv1303.0728MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
Related Items