{"version":"1.0","type":"link","title":"Matroid parity problem - Newikis","description":"In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure that abstracts and generalizes the notion of linear independence in vector spaces. The problem was formulated by Lawler (1976) as a common…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/f/fe/Graphic_matroid_parity.svg/1280px-Graphic_matroid_parity.svg.png","thumbnail_width":1280,"thumbnail_height":1671}