Generating Minimal Redundant and Maximal Irredundant Sets in Incidence Graphs

Emanuel Elias Silva Castelo, Jérémie Chalopin, Oscar Defrain, Simon Vilmin. Generating Minimal Redundant and Maximal Irredundant Sets in Incidence Graphs. In Michal Koucký 0001, Daniela Petrisan, editors, 51st International Symposium on Mathematical Foundations of Computer Science, MFCS 2026, Paris, France, August 24-28, 2026. Volume 386 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. [doi]

Authors

Emanuel Elias Silva Castelo

This author has not been identified. Look up 'Emanuel Elias Silva Castelo' in Google

Jérémie Chalopin

This author has not been identified. Look up 'Jérémie Chalopin' in Google

Oscar Defrain

This author has not been identified. Look up 'Oscar Defrain' in Google

Simon Vilmin

This author has not been identified. Look up 'Simon Vilmin' in Google