Philip N. Klein

1. A randomized linear-time algorithm to find minimum spanning trees
   1995/03/01 by David R. Karger, Philip N. Klein, Robert E. Tarjan · 14 citations
   Computer Science · #Algorithms and Data Compression #Data Management and Algorithms #Data Mining Algorithms and Applications
2. On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
   2020/09/10 by Vincent Cohen-Addad, Cohen-Addad, Vincent, Arnold Filtser +5 · 2 citations
   Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Smart Parking Systems Research
3. The two-edge connectivity survivable-network design problem in planar\n graphs
   2013/02/08 by Glencora Borradaile, Borradaile, Glencora, Philip N. Klein +2 · 1 citation
   Computer Science · #Interconnection Networks and Systems #Complexity and Algorithms in Graphs #Software-Defined Networks and 5G