Tag Archives: Dynamic Solutions for Leader Failure in 3D Torus Networks

Volume 4, Issue 3, 2014

An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star123-free Graphs Ruzayn Quaddoura, Department of Computer Science, Faculty of Science and Information Technology, Zarqa University, Zarqa-Jordan. Abstract— A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no… Read More »