Keyword: graphs

Found 1175 papers in total
Dynamic Programming on the Word RAM
Dynamic Programming on the Word RAM
2003,
Dynamic programming is one of the fundamental techniques for solving optimization...
An exact approach for scheduling jobs with regular step cost functions on a single machine
An exact approach for scheduling jobs with regular step cost functions on a single machine
2012,
This paper studies a single‐machine scheduling problem whose objective is to...
Integrated efficiency and trade‐off analyses using a DEA‐oriented interactive minimax reference point approach
Integrated efficiency and trade‐off analyses using a DEA‐oriented interactive minimax reference point approach
2012,
A DEA ‐oriented Interactive Minimax Reference Point ( DEA‐IMRP )...
Extended maximum generally weighted moving average control chart for monitoring process mean and variability
Extended maximum generally weighted moving average control chart for monitoring process mean and variability
2012,
In this paper, we propose an extended control chart, called the maximum generally...
Searching Steiner trees for web graph query
Searching Steiner trees for web graph query
2012,
The enormous growth in information technology has revolutionized the way people can...
Parameterized fairness axioms on cycle‐free graph games
Parameterized fairness axioms on cycle‐free graph games
2012,
We study cooperative transferable utility games with a communication structure...
A combined synthetic and np scheme for detecting increases in fraction nonconforming
A combined synthetic and np scheme for detecting increases in fraction nonconforming
2012,
The applications of attribute control charts cover a wide variety of manufacturing...
Analysis of the contact graph routing algorithm: Bounding interplanetary paths
Analysis of the contact graph routing algorithm: Bounding interplanetary paths
2012,
Interplanetary communication networks comprise orbiters, deep‐space relays, and...
Modelling and assessing ERP project risks: A Petri Net approach
Modelling and assessing ERP project risks: A Petri Net approach
2012,
Risk management of Enterprise Resource Planning (ERP) projects is largely recognized...
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
2012,
In this paper, two similar NP‐hard optimization problems on graphs are...
Fault‐tolerant diameter for three family interconnection networks
Fault‐tolerant diameter for three family interconnection networks
2012,
Let G =( V , E ) be an k ‐connected graph. The ( k...
Fast Arc‐Annotated Subsequence Matching in Linear Space
Fast Arc‐Annotated Subsequence Matching in Linear Space
2012,
An arc‐annotated string is a string of characters, called bases, augmented with...
Competitive Weighted Matching in Transversal Matroids
Competitive Weighted Matching in Transversal Matroids
2012,
Consider a bipartite graph with a set of left‐vertices and a set of...
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem
2002,
We say a vertex v in a graph G covers a vertex w if v=w or if v and w are adjacent. A...
A comparison study of effectiveness and robustness of control charts for monitoring process mean
A comparison study of effectiveness and robustness of control charts for monitoring process mean
2012,
This article compares the effectiveness and robustness of nine typical control charts...
Scheduling jobs on identical machines with agreement graph
Scheduling jobs on identical machines with agreement graph
2012,
We consider the following problem of scheduling with agreements: a set of jobs must be...
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
2002,
{In this paper we design and analyze a neural approximation algorithm for the Maximum...
Identifying large robust network clusters via new compact formulations of maximum k‐club problems
Identifying large robust network clusters via new compact formulations of maximum k‐club problems
2012,
Network robustness issues are crucial in a variety of application areas. In many...
A graph‐pair representation and MIP‐model‐based heuristic for the unequal‐area facility layout problem
A graph‐pair representation and MIP‐model‐based heuristic for the unequal‐area facility layout problem
2012,
Owing to its theoretical as well as practical significance, the facility layout...
A Distributed Algorithm for Computing the Node Search Number in Trees
A Distributed Algorithm for Computing the Node Search Number in Trees
2012,
We present a distributed algorithm to compute the node search number in trees. This...
On Equilibria for ADM Minimization Games
On Equilibria for ADM Minimization Games
2012,
In the ADM minimization problem the input is a set of arcs along a directed ring. The...
A Competitive Analysis for Balanced Transactional Memory Workloads
A Competitive Analysis for Balanced Transactional Memory Workloads
2012,
We consider transactional memory contention management in the context of balanced...
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm
2012,
Let ℬ be a centrally symmetric convex polygon of ℝ 2 and ∥ p - q...
Finding the k Shortest Paths in Parallel
Finding the k Shortest Paths in Parallel
2000,
A concurrent‐read exclusive‐write PRAM algorithm is developed to find...
Papers per page: