The design of telecommunication network with capacity constraints of links, routers and ports of routers is considered in this paper. Specially, we limit each demand flow traversed through a pre-specified maximal number of links (called hops) under node failure scenarios in IP layer network. Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when...

We study the problem of finding a fractional node-capacitated multiflow of maximum value in an undirected network. Previously known methods for this problem are based on linear programming and the ellipsoid method. In this paper we apply a capacity scaling approach and develop a purely combinatorial weakly polynomial algorithm of time complexity O(Λ(n, m, U) n log n log U), where n, m, U are th...

Automatic feature learning algorithms are at the forefront of modern day machine learning research. We present a novel algorithm, supervised Q-walk, which applies Q-learning to generate random walks on graphs such that the walks prove to be useful for learning node features suitable for tackling with the node classification problem. We present another novel algorithm, k-hops neighborhood based ...

Infrastructure-less (sometimes known as ad-hoc) networking paradigm is very appealing and potentially shaping its future into almost all emerging networks (i.e., IoT, wireless sensor networks, vehicular ad-hoc emergency, tactical radio etc.). However, when conventional protocols are used, such often perform poorly, mainly because of interference within the network limited throughput. Recent adv...

A k-coloring of G = (V,E) is a partition S = (S1, . . . , Sk) of the node set V of G into stable sets Si (a stable set is a set of pairwise non adjacent nodes). In the usual case, the objective is to determine a node coloring minimizing k. A natural generalization of this problem is obtained by assigning a strictly positive integer weight w(v) for any node v ∈ V , and defining the weight of sta...

schwannomas are benign nerve sheath tumors that originate from any anatomical site. most of the schwannomas are found in the head, neck or limbs. schwannoma arising in a lymph node is extremely rare. we have found only four cases in the review of the literature. we experienced a case of intranodal schwannoma in a perigastric lymph node. a 72 year-old female underwent cholecystectomy due to clin...

It is shown that the loading problem for a 6 node neural network with node function set AC1 (that is, the conjunction or disjunction of a subset of the inputs or their complements) is NP complete. It can be deduced from this observation that the loading problem for a 6 node analog neural network is NP hard.

An algorithm is described for solving the node-to-set disjoint paths problem in bi-rotator graphs, which are obtained by making each edge of a rotator graph bi-directional. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into three cases according to the distribution of destination nodes in the classes into which the nodes in a bi-rotato...

Given a connected node-weighted (di)graph, with a root node r, and a (possibly empty) set of nodes R, the Rooted Maximum NodeWeight Connected Subgraph Problem (RMWCS) is the problem of finding a connected subgraph rooted at r that connects all nodes in R with maximum total weight. In this paper we consider the RMWCS as well as its budget-constrained version, in which also non-negative costs of ...

In this paper, we give an algorithm for the nodeto-set disjoint paths problem in pancake graphs with its evaluation results. The algorithm is of polynomial order of n for an n-pancake graph. It is based on recursion and divided into two cases according to the distribution of destination nodes in classes into which all the nodes in a pancake graph are categorized. The sum of lengths of paths obt...