On Optimal Ear-Decompositions of Graphs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
An O(VE) algorithm for ear decompositions of matching-covered graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An O(VE) algorithm for ear decompositions of matching-covered graphs
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |