Keyword: graphs

Found 1175 papers in total
A hybrid shifting bottleneck procedure algorithm for the parallel‐machine job‐shop scheduling problem
A hybrid shifting bottleneck procedure algorithm for the parallel‐machine job‐shop scheduling problem
2012,
In practice, parallel‐machine job‐shop scheduling (PMJSS) is very useful...
An exact algorithm for minimizing vertex guards on art galleries
An exact algorithm for minimizing vertex guards on art galleries
2011,
We consider the problem [art gallery problem (AGP)] of minimizing the number of vertex...
Using an interval graph approach to efficiently solve the housing benefit data retrieval problem
Using an interval graph approach to efficiently solve the housing benefit data retrieval problem
2011,
Rappos and Thompson use a set covering formulation and a commercial software package...
Facility Location: A Robust Optimization Approach
Facility Location: A Robust Optimization Approach
2011,
In this research, we apply robust optimization (RO) to the problem of locating...
Popular matchings: structure and algorithms
Popular matchings: structure and algorithms
2011,
An instance of the popular matching problem (POP-M) consists of a set of applicants...
Post‐retrieval search hit clustering to improve information retrieval effectiveness: Two digital forensics case studies
Post‐retrieval search hit clustering to improve information retrieval effectiveness: Two digital forensics case studies
2011,
This research extends text mining and information retrieval research to the digital...
A framework for exploring organizational structure in dynamic social networks
A framework for exploring organizational structure in dynamic social networks
2011,
Recent research has provided promising results relating to discovering communities...
Compression and denoising using l 0‐norm
Compression and denoising using l 0‐norm
2011,
In this paper, we deal with l 0 ‐norm data fitting and total variation...
Seeking global edges for traveling salesman problem in multi‐start search
Seeking global edges for traveling salesman problem in multi‐start search
2011,
This study investigates the properties of the edges in a set of locally optimal tours...
New decision rules for exact search in N‐Queens
New decision rules for exact search in N‐Queens
2011,
This paper presents a set of new decision rules for exact search in N‐Queens....
Second‐order conditions for nonsmooth multiobjective optimization problems with inclusion constraints
Second‐order conditions for nonsmooth multiobjective optimization problems with inclusion constraints
2011,
This paper investigates second‐order optimality conditions for general...
On saturation effects in the Neumann boundary control of elliptic optimal control problems
On saturation effects in the Neumann boundary control of elliptic optimal control problems
2011,
A Neumann boundary control problem for a linear‐quadratic elliptic optimal...
Applying Powell’s symmetrical technique to conjugate gradient methods
Applying Powell’s symmetrical technique to conjugate gradient methods
2011,
A new conjugate gradient method is proposed by applying Powell’s symmetrical...
Using service responsibility tables to supplement UML in analyzing e‐service systems
Using service responsibility tables to supplement UML in analyzing e‐service systems
2011,
This paper proposes using Service Responsibility Tables (SRTs) as a tool in analyzing...
Estimating the effect of word of mouth on churn and cross‐buying in the mobile phone market with Markov logic networks
Estimating the effect of word of mouth on churn and cross‐buying in the mobile phone market with Markov logic networks
2011,
Much has been written about word of mouth and customer behavior. Telephone call detail...
Secure business process model specification through a UML 2.0 activity diagram profile
Secure business process model specification through a UML 2.0 activity diagram profile
2011,
In this paper, we present an extension of UML 2.0 activity diagrams which will allow...
Optimal control of the Stokes equations: conforming and non‐conforming finite element methods under reduced regularity
Optimal control of the Stokes equations: conforming and non‐conforming finite element methods under reduced regularity
2011,
This paper deals with a control‐constrained linear‐quadratic optimal...
Maximum information stored in a labeled connected network with minimum edges
Maximum information stored in a labeled connected network with minimum edges
2011,
Given a set X, we consider the problem of finding a graph G with vertex set X and the...
Honeynet games: a game theoretic approach to defending network monitors
Honeynet games: a game theoretic approach to defending network monitors
2011,
A honeynet is a portion of routed but otherwise unused address space that is...
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
2011,
Let G =( VG , AG ) be a digraph and let S ⊔ T be a bipartition of VG . A...
How to Guard a Graph?
How to Guard a Graph?
2011,
We initiate the study of the algorithmic foundations of games in which a set of cops...
Another Sub‐exponential Algorithm for the Simple Stochastic Game
Another Sub‐exponential Algorithm for the Simple Stochastic Game
2011,
We study the problem of solving simple stochastic games, and give both an interesting...
A New Algorithm for Finding Trees with Many Leaves
A New Algorithm for Finding Trees with Many Leaves
2011,
We present an algorithm that finds out‐trees and out‐branchings with at...
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs
2011,
Connected dominating set (CDS) in unit disk graphs has a wide range of applications in...
Papers per page: