Resilience and optimization of identifiable bipartite graphs

DOI10.1016/j.dam.2012.01.005zbMath1259.68160OpenAlexW2129759905MaRDI QIDQ1941385

Martin Milanič, Epameinondas Fritzilas, Yasmin A. Rios-Solis, Jérôme Monnot

Publication date: 12 March 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.005

zbMATH Keywords

bipartite graphmatchingidentifiabilityresilience

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the complexity of the identifiable subgraph problem, revisited ⋮ BNCA: Full-rank Factorisable Subgraphs Based Unique Structure-Constrained Matrix Factorisation ⋮ Phylogenetic flexibility via Hall-type inequalities and submodularity ⋮ On the complexity of the identifiable subgraph problem

This page was built for publication: Resilience and optimization of identifiable bipartite graphs