{"version":"1.0","type":"link","title":"Carving width - Newikis","description":"In graph theory, the carving width of a graph is a number, defined from the graph, that describes the number of edges separating the clusters in a hierarchical clustering of the graph vertices.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}