{"version":"1.0","type":"link","title":"Pathwidth - Newikis","description":"In graph theory, a path decomposition of a graph G is, informally, a representation of G as a \"thickened\" path graph, and the pathwidth of G is a number that measures how much the path was thickened to form G. More formally, a path-decomposition is a sequence of subsets of vertices of G such that…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}