Examens corriges

4.1 Undirected Graphs - cs.Princeton

MST. What is the best way to connect all of the vertices? Biconnectivity. Is there a vertex whose removal disconnects the graph? Planarity.





Télécharger 4.1 Undirected Graphs - cs.Princeton pdf