—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Let be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of . This paper aims to characterize (, G) under the conditions that the quotient gr...