Maximum matching in multi-interface networks

DOI10.1016/j.tcs.2013.01.018zbMath1302.05143OpenAlexW2125676641MaRDI QIDQ393046

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

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.018

zbMATH Keywords

graph algorithmsnetwork optimizationwireless networksinduced matching problemmulti-interface networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) 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

Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks, Maximum matchings in scale-free networks with identical degree distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the induced matching problem
• On distance-3 matchings and induced matchings
• Induced matchings
• Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
• On the approximability of the maximum induced matching problem
• New results on induced matchings
• Minimize the maximum duty in multi-interface networks
• Bandwidth Constrained Multi-interface Networks
• Energy-Efficient Communication in Multi-interface Wireless Networks
• Induced Matchings in Subcubic Planar Graphs
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces
• Paths, Trees, and Flowers