Keyword: graphs

Found 1175 papers in total
Exact solution of the 2‐dimensional grid arrangement problem
Exact solution of the 2‐dimensional grid arrangement problem
2012,
Given an undirected graph G = ( V , E ) , we consider injective mappings of its...
Reliability of task graph schedules with transient and fail‐stop failures: complexity and algorithms
Reliability of task graph schedules with transient and fail‐stop failures: complexity and algorithms
2012,
This paper deals with the reliability of task graph schedules with transient and...
Memetic search for the max‐bisection problem
Memetic search for the max‐bisection problem
2013,
Given an undirected graph G = ( V , E ) with weights on the edges, the...
Branch and bound for the cutwidth minimization problem
Branch and bound for the cutwidth minimization problem
2013,
The cutwidth minimization problem consists of finding a linear arrangement of the...
The minimum cost shortest‐path tree game
The minimum cost shortest‐path tree game
2012,
A minimum cost shortest‐path tree is a tree that connects the source with every...
One‐dimensional geometric random graphs with nonvanishing densities II: a very strong zero‐one law for connectivity
One‐dimensional geometric random graphs with nonvanishing densities II: a very strong zero‐one law for connectivity
2012,
We consider a collection of n independent points which are distributed on the unit...
Total domination and the Caccetta–Häggkvist conjecture
Total domination and the Caccetta–Häggkvist conjecture
2012,
A total dominating set in a digraph G is a subset W of its vertices such that every...
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
2011,
Connectedness of efficient solutions is a powerful property in multiple objective...
A graph‐based action network framework to identify prestigious members through member's prestige evolution
A graph‐based action network framework to identify prestigious members through member's prestige evolution
2012,
Prestigious members on social networking websites are attracting increasing attentions...
Building a term suggestion and ranking system based on a probabilistic analysis model and a semantic analysis graph
Building a term suggestion and ranking system based on a probabilistic analysis model and a semantic analysis graph
2012,
Term suggestion is a kind of information retrieval technique that attempts to suggest...
A survey of control‐chart pattern‐recognition literature (1991–2010) based on a new conceptual classification scheme
A survey of control‐chart pattern‐recognition literature (1991–2010) based on a new conceptual classification scheme
2012,
Control Chart Pattern Recognition (CCPR) is a critical task in Statistical Process...
The best choice problem for upward directed graphs
The best choice problem for upward directed graphs
2012,
We consider a generalization of the best choice problem to upward directed graphs. We...
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
2012,
In this note, we show that if the maximum clique problem can be solved by a polynomial...
Optimizing bus‐size and headway in transit networks
Optimizing bus‐size and headway in transit networks
2012,
Optimization models for calculating the best size for passenger carrying vehicles in...
Applications of Variational Analysis to a Generalized Fermat‐Torricelli Problem
Applications of Variational Analysis to a Generalized Fermat‐Torricelli Problem
2011,
In this paper we develop new applications of variational analysis and generalized...
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
2011,
Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems...
Unconstrained formulation of standard quadratic optimization problems
Unconstrained formulation of standard quadratic optimization problems
2012,
A standard quadratic optimization problem (StQP) consists of finding the largest or...
Enhancing discretized formulations: the knapsack reformulation and the star reformulation
Enhancing discretized formulations: the knapsack reformulation and the star reformulation
2012,
Discretized formulations have proved to be useful for modeling combinatorial...
Scheduling of pipelined operator graphs
Scheduling of pipelined operator graphs
2012,
We investigate a class of scheduling problems that arise in the optimization of SQL...
Minimum recession‐compatible subsets of closed convex sets
Minimum recession‐compatible subsets of closed convex sets
2012,
A subset B of a closed convex set A is recession‐compatible with respect to A...
Computing the Treewidth and the Minimum Fill‐In with the Modular Decomposition
Computing the Treewidth and the Minimum Fill‐In with the Modular Decomposition
2003,
Using the notion of modular decomposition we extend the class of graphs on which both...
Cliques with maximum/minimum edge neighborhood and neighborhood density
Cliques with maximum/minimum edge neighborhood and neighborhood density
2012,
This paper addresses maximum/minimum edge neighborhood and neighborhood density...
An LP‐based heuristic algorithm for the node capacitated in‐tree packing problem
An LP‐based heuristic algorithm for the node capacitated in‐tree packing problem
2012,
We conducted computational experiments on graphs used in related papers and on...
Extended local search algorithm based on nonlinear programming for two‐dimensional irregular strip packing problem
Extended local search algorithm based on nonlinear programming for two‐dimensional irregular strip packing problem
2012,
This paper presents an extended local search algorithm (ELS) for the irregular strip...
Papers per page: