The following pages link to A Theorem on Planar Graphs (Q5806389):
Displaying 9 items.
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders (Q352121) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- (Q5158500) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs (Q5378213) (← links)
