Minimum cycle bases of weighted outerplanar graphs
From MaRDI portal
Publication:1675771
DOI10.1016/j.ipl.2010.08.005zbMath1379.05110OpenAlexW1994716794MaRDI QIDQ1675771
Hsueh-I H.-I Lu, Tsung-Hao Liu
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.005
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Minimum cycle bases of direct products of complete graphs
- Classes of cycle bases
- Matrix multiplication via arithmetic progressions
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Designing networks with compact routing tables
- Minimal cycle bases of outerplanar graphs
- Minimum cycle bases for network graphs
- Minimum Cycle Bases in Graphs Algorithms and Applications
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
- Minimum Cycle Bases of Weighted Outerplanar Graphs
- 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
- Automata, Languages and Programming
- On the basic number and the minimum cycle bases of the wreath product of some graphs I.
This page was built for publication: Minimum cycle bases of weighted outerplanar graphs