A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...