Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,047,885 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Algorithm
Arboricity
Degree (graph theory)
Directed graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Combinatorial Preconditioners for Proximal Algorithms on Graphs
Thomas Möllenhoff
,
Zhenzhang Ye
,
Tao Wu
,
D. Cremers
International Conference on Artificial…
2018
Corpus ID: 3386639
We present a novel preconditioning technique for proximal optimization methods that relies on graph algorithms to construct…
Expand
2013
2013
cient Computation of Compact Representations of Sparse Graphs �
S. Arikati
,
A. Maheshwari
,
C. Zaroliagis
2013
Corpus ID: 15085593
Sparse graphs e g trees planar graphs relative neighborhood graphs are among the commonly used data structures in computational…
Expand