Pages that link to "Item:Q5891165"
From MaRDI portal
The following pages link to Computing the Girth of a Planar Graph in Linear Time (Q5891165):
Displayed 9 items.
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant (Q2420422) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- (Q5009573) (← links)
- (Q5075809) (← links)
- (Q5894220) (redirect page) (← links)
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)