Keyword: graphs

Found 1175 papers in total
Uniformity of Node Level Conflict Measures in Bayesian Hierarchical Models Based on Directed Acyclic Graphs
Uniformity of Node Level Conflict Measures in Bayesian Hierarchical Models Based on Directed Acyclic Graphs
2016,
Hierarchical models defined by means of directed, acyclic graphs are a powerful and...
Convoy movement problem: a civilian perspective
Convoy movement problem: a civilian perspective
2017,
We study the convoy movement problem in peacetime from a civilian perspective by...
A note on heuristic approach based on UBQP formulation of the maximum diversity problem
A note on heuristic approach based on UBQP formulation of the maximum diversity problem
2017,
The maximum diversity problem (MDP) is a challenging NP‐hard problem with a...
Cancel-and-tighten algorithm for quickest flow problems
Cancel-and-tighten algorithm for quickest flow problems
2017,
Given a directed graph with a capacity and a transit time for each arc and with single...
Bidirected minimum Manhattan network problem
Bidirected minimum Manhattan network problem
2017,
In the bidirected minimum Manhattan network problem, given a set T of n terminals in...
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
2017,
We propose a two‐stage stochastic programming framework for designing or...
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
2017,
We study the planar maximum coverage location problem (MCLP) with rectilinear distance...
Assessing Risk in Graphically Presented Financial Series
Assessing Risk in Graphically Presented Financial Series
2016,
It has been argued that traders use their natural sensitivity to the fractal...
On the spectrum of the normalized Laplacian of iterated triangulations of graphs
On the spectrum of the normalized Laplacian of iterated triangulations of graphs
2016,
The eigenvalues of the normalized Laplacian of a graph provide information on its...
Acyclic and star coloring of P 4-reducible and P 4-sparse graphs
Acyclic and star coloring of P 4-reducible and P 4-sparse graphs
2016,
An acyclic coloring of a graph G is a proper vertex coloring such that G contains no...
Extremal Laplacian energy of threshold graphs
Extremal Laplacian energy of threshold graphs
2016,
Let G be a connected threshold graph of order n with m edges and trace T . In this...
On topological properties of the line graphs of subdivision graphs of certain nanostructures
On topological properties of the line graphs of subdivision graphs of certain nanostructures
2016,
In the study of QSAR/QSPR, topological indices such as Shultz index, generalized...
Some remarks on Wiener index of oriented graphs
Some remarks on Wiener index of oriented graphs
2016,
In this paper, we study the Wiener index (i.e., the total distance or the transmission...
Outline capturing using rational functions with the help of genetic algorithm
Outline capturing using rational functions with the help of genetic algorithm
2016,
A technique to capture outline of planar objects using two rational cubic functions...
Two node-disjoint hop-constrained survivable network design and polyhedra
Two node-disjoint hop-constrained survivable network design and polyhedra
2016,
Given a weighted undirected graph G with a set of pairs of terminals (s i , t i ), i =...
Algorithms and complexity results for finding graphs with extremal Randic index
Algorithms and complexity results for finding graphs with extremal Randic index
2016,
We show that finding a subgraph realization with the minimum generalized Randić...
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
2016,
Flow cover inequalities are among the most effective valid inequalities for...
The power edge set problem
The power edge set problem
2016,
The automated real time control of an electrical network is achieved through the...
On the roots of the node reliability polynomial
On the roots of the node reliability polynomial
2016,
Given a graph G whose edges are perfectly reliable and whose nodes each operate...
The Rainbow Cycle Cover Problem
The Rainbow Cycle Cover Problem
2016,
We model and solve the Rainbow Cycle Cover Problem (RCCP). Given a connected and...
Minimal disconnected cuts in planar graphs
Minimal disconnected cuts in planar graphs
2016,
The problem of finding a disconnected cut in a graph is NP‐hard in general but...
Minimum bottleneck spanning trees with degree bounds
Minimum bottleneck spanning trees with degree bounds
2016,
Given a graph G with edge lengths, the minimum bottleneck spanning tree (MBST) problem...
The bottleneck selected-internal and partial terminal Steiner tree problems
The bottleneck selected-internal and partial terminal Steiner tree problems
2016,
Given a complete graph G = ( V , E ) , a positive length function on edges, and two...
A Parallel Strategy for the Logical-probabilistic Calculus-based Method to Calculate Two-terminal Reliability
A Parallel Strategy for the Logical-probabilistic Calculus-based Method to Calculate Two-terminal Reliability
2016,
The theory of network reliability has been applied to many complicated network...
Papers per page: