Maximum Matching in Multi-Interface Networks

DOI10.1007/978-3-642-31770-5_2zbMath1301.68037OpenAlexW2995794429MaRDI QIDQ3167345

Adrian Kosowski, Alfredo Navarra, Cristina M. Pinotti, Dominik Pająk

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_2

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the induced matching problem in Hamiltonian bipartite graphs

This page was built for publication: Maximum Matching in Multi-Interface Networks