New results on induced matchings
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Reconsidering wireless systems with multiple radios
ACM SIGCOMM Computer Communication Review
Energetic performance of service-oriented multi-radio networks: issues and perspectives
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Energy-Efficient Communication in Multi-interface Wireless Networks
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Exploiting multi-interface networks: Connectivity and Cheapest Paths
Wireless Networks
Induced matchings in subcubic planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Bandwidth constrained multi-interface networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
On the induced matching problem
Journal of Computer and System Sciences
Hi-index | 5.23 |
In heterogeneous networks, devices can communicate by means of multiple wireless interfaces. By choosing which interfaces to switch on at each device, several connections might be established. That is, the devices at the endpoints of each connection share at least one active interface. In this paper, we consider the standard matching problem in the context of multi-interface wireless networks. The aim is to maximize the number of parallel connections without incurring interferences. Given a network G=(V,E), nodes V represent the devices, and edges E represent the connections that can be established. If node x participates in the communication with one of its neighbors by means of interface i, then another neighboring node of x can establish a connection (but not with x) only if it makes use of interface ji. The size of a solution for an instance of the outcoming matching problem, which we call Maximum Matching in Multi-Interface networks (MMMI for short), is always in between the sizes of the solutions for the same instance with respect to the standard matching and its induced version problems. However, we prove that MMMI is NP-hard even for proper interval graphs and for bipartite graphs of maximum degree @D=3. We also show polynomially solvable cases of MMMI with respect to different assumptions.