Matroid partitioning

The matroid partitioning problem is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms, in which…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We present a novel preconditioning technique for proximal optimization methods that relies on graph algorithms to construct…

2013

Sparse graphs e g trees planar graphs relative neighborhood graphs are among the commonly used data structures in computational…

1994

Sparse graphs (e.g. trees, planar graphs, relative neighborhood graphs) are among the commonly used data-structures in…

1992