Investigating the correlations between graph metrics in various networks is a prosperous research topic that only starts to evolve. Knowledge about graph metrics interrelations may be beneficial in many other aspects of networks studying, starting from optimizing computations to even detecting...

The landscape in the world trade network has changed in last few decades. This paper analyses World Trade Network (WTN) from 1990 to 2016, using the trade data available at the International Monetary Fund (IMF) website and presents the evolution of key players in the network using link analysis...

Combinatorial auctions are increasingly being used to allocate bundles of items among interested bidders. However, as the number of bundles increases, it takes exponentially longer to solve for the winners in the auction. In such situations, regular solvers such as IBM CPLEX or AMPL fail to...

In this paper we construct for each integer ≥ 11, ≠ 12 15 a pair of trees of order which are not isomorphic but numerically isomeric. We also construct for each even ≥ 12 a pair of 2connected cubic graphs with the same property

A key challenge for Bitcoin cryptocurrency holders, such as startups using ICOs to raise funding, is managing their FX risk. Specifically, a misinformed decision to convert Bitcoin to fiat currency could, by itself, cost USD millions. In contrast to financial exchanges, blockchain based...

The labeling problem considered for this is called face-labeling of the maximal planar or triangular planar graphs in connection with the notion of the . Several triangular planar and maximal planar graphs such as the wheels, the fans etc. have been considered. The face-labeling of maximal...

Given a set of points in a plane, a spanning tree is a set of edges that connects all the points and contains no cycles. If each edge is weighted using the rectilinear distance metric, the rectilinear minimum spanning tree is a tree whose sum of edge weights is minimum. A naive approach to...

This paper is concerned with the stochastic shortest path problem with recourse when limited forms of spatial and temporal arc cost dependencies are accounted for. Recourse is defined as the opportunity for a decision-maker to re-evaluate his or her remaining path when en route information is...

A graph is called regularable if it is possible to label its edges with integers so that the sum of the integers assigned to the edges incident to the vertices are all same, say equal to . Clearly if the given graph is regular of degree then there is no need to find an edge-assignment; simply...

The paper presents analysis of the storage systems used by social network sites. Namely, the social networks are one of the main driving forces behind the NoSQL database development. Facebook and Twitter were, together with other the Big Data players like Google and Amazon, first faced with the...