Keyword: graphs

Found 1175 papers in total
Scatter search for the profile minimization problem
Scatter search for the profile minimization problem
2015,
We study the problem of minimizing the profile of a graph and develop a solution...
Firework Plot as a Graphical Exploratory Data Analysis Tool for Evaluating the Impact of Outliers in Data Exploration and Regression
Firework Plot as a Graphical Exploratory Data Analysis Tool for Evaluating the Impact of Outliers in Data Exploration and Regression
2014,
Outliers can distort many measures for data analysis. We propose a new set of...
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines
2014,
We study the problem of scheduling n non‐preemptive jobs on m unrelated...
The conic property for vector measure market games
The conic property for vector measure market games
2015,
We prove that every continuous value on a space of vector measure market games Q ,...
Evolution of social networks
Evolution of social networks
2014,
Modeling the evolution of networks is central to our understanding of large...
Merging valid inequalities over the multiple knapsack polyhedron
Merging valid inequalities over the multiple knapsack polyhedron
2015,
This paper provides the theoretical foundations for generating a new class of valid...
Detecting and visualizing outliers in provider profiling via funnel plots and mixed effect models
Detecting and visualizing outliers in provider profiling via funnel plots and mixed effect models
2015,
In this work we propose the use of a graphical diagnostic tool (the funnel plot) to...
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
2015,
Connected dominating set ( CDS ) has played an important role in building virtual...
Group irregularity strength of connected graphs
Group irregularity strength of connected graphs
2015,
We investigate the group irregularity strength ( s g ( G ) ) of graphs, that is, we...
An algorithm for the dominator chromatic number of a tree
An algorithm for the dominator chromatic number of a tree
2015,
A dominator coloring of a graph G is an assignment of colors to the vertices of G such...
L(d,1)-labelings of the edge-path-replacement by factorization of graphs
L(d,1)-labelings of the edge-path-replacement by factorization of graphs
2015,
For an integer d ≥ 2 , an L ( d , 1 ) ‐labeling of a graph G is a function f...
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths
2015,
We consider the k ‐Canadian Traveller Problem, which asks for a shortest path...
Game domination subdivision number of a graph
Game domination subdivision number of a graph
2015,
The game domination subdivision number of a graph G is defined by the following game....
On the complexity of partitioning a graph into a few connected subgraphs
On the complexity of partitioning a graph into a few connected subgraphs
2015,
Given a graph G , a sequence τ = ( n 1 , … , n p ) of positive integers...
Combinatorial Aspects of Parker’s Model
Combinatorial Aspects of Parker’s Model
2015,
Parker’s model under rare mutation is considered when there is a finite set of...
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
2015,
The minimum cost subset k ‐connected subgraph problem is a cornerstone problem...
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
2015,
We give a subexponential fixed parameter algorithm for one‐sided crossing...
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
2015,
We show that all minimal edge dominating sets of a graph can be generated in...
Program Size and Temperature in Self-Assembly
Program Size and Temperature in Self-Assembly
2015,
Winfree’s abstract Tile Assembly Model is a model of molecular...
Modeling Compositional Time Series with Vector Autoregressive Models
Modeling Compositional Time Series with Vector Autoregressive Models
2015,
Multivariate time series describing relative contributions to a total (like...
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
2015,
Let G = ( V, E ) be an undirected graph with costs associated with its edges and K...
The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
2016,
This paper presents a novel application of operations research techniques to the...
Generalized measures for fault tolerance of star networks
Generalized measures for fault tolerance of star networks
2014,
This article shows that, for any integers n and k with 0≤k≤n−2, at least...
A comparison of several models for the hamiltonian p-median problem
A comparison of several models for the hamiltonian p-median problem
2014,
The Hamiltonian p‐median problem consists of determining p disjoint cycles of...
Papers per page: