Pages that link to "Item:Q4307048"

The following pages link to The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs (Q4307048):

Displaying 9 items.

• Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
• Characterization of minimum cycle basis in weighted partial 2-trees (Q491600) (← links)
• New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
• Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
• The planar multiterminal cut problem (Q1130183) (← links)
• Minimum cycle bases of weighted outerplanar graphs (Q1675771) (← links)
• Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)