Characterization of minimum cycle basis in weighted partial 2-trees
From MaRDI portal
Abstract: For a weighted outerplanar graph, the set of lex short cycles is known to be a minimum cycle basis [Inf. Process. Lett. 110 (2010) 970-974 ]. In this work, we show that the set of lex short cycles is a minimum cycle basis in weighted partial 2-trees (graphs of treewidth two) which is a superclass of outerplanar graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3853133 (Why is no real title available?)
- scientific article; zbMATH DE number 3024665 (Why is no real title available?)
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Computing minimum cycle bases in weighted partial 2-trees in linear time
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Minimal cycle bases of outerplanar graphs
- Minimum cycle bases of Halin graphs
- Minimum cycle bases of weighted outerplanar graphs
- On Vector Spaces Associated with a Graph
- The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
Cited in
(4)
This page was built for publication: Characterization of minimum cycle basis in weighted partial 2-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491600)