Maximum matching in multi-interface networks

DOI10.1016/J.TCS.2013.01.018MaRDI QIDQ393046zbMATH OpenOpenAlexFDO

Authors Adrian Kosowski, Alfredo Navarra, Cristina M. Pinotti, Dominik Pajak

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 algorithmsinduced matching problemmulti-interface networksnetwork optimizationwireless networks

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Maximum matching in multi-interface networks
• Min-max coverage in multi-interface networks
• Minimize the maximum duty in multi-interface networks
• Bandwidth constrained multi-interface networks
• Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks

Cites work

• Bandwidth constrained multi-interface networks
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces
• Energy-Efficient Communication in Multi-interface Wireless Networks
• 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
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1420901 (Why is no real title available?)
• Induced matchings
• Induced matchings in subcubic planar graphs
• Minimize the maximum duty in multi-interface networks
• New results on induced matchings
• On distance-3 matchings and induced matchings
• On the approximability of the maximum induced matching problem
• On the induced matching problem
• Paths, Trees, and Flowers

Cited in

(6)

• Match algorithms for generalized Rete networks
• Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks
• Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
• Maximum matching in multi-interface networks
• Maximum matchings in scale-free networks with identical degree distribution
• On budget-constrained coverage in multi-interface networks: branchwidth and treewidth perspectives

This page was built for publication: Maximum matching in multi-interface networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393046)