Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond

Finding a maximum cardinality common independent set in two matroids (also known as Matroid Intersection) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum bipartite matching, a maximum colorful forest, and an arborescence in...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 304; p. 105282
Main Authors:	Kobayashi, Yasuaki, Kurita, Kazuhiro, Wasa, Kunihiro
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2025
Subjects:	Matroid intersection Matroid matching Polynomial-delay enumeration Ranked enumeration Reverse search Matroid intersection Ranked enumeration Polynomial-delay enumeration Matroid matching Reverse search
ISSN:	0890-5401
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!