19 citations · 62 across the 27 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010★ 1 cited
NP-completeness Proof: RBCDN Reduction Problem
Sujogya Banerjee, Shahrzad Shirazipourazad, Pavel Ghosh +1
Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.
cs.NI2010★ 5 cited
Architecture and Algorithms for an Airborne Network
Arunabha Sen, Pavel Ghosh, Tiffany Silva +2
The U.S. Air Force currently is in the process of developing an Airborne Network (AN) to provide support to its combat aircrafts on a mission. The reliability needed for continuous…