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...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 304; s. 105282
Hlavní autori:	Kobayashi, Yasuaki, Kurita, Kazuhiro, Wasa, Kunihiro
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.05.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!