Journal: Journal of Combinatorial Optimization

Found 352 papers in total
Constructions of given‐depth and optimal multirate rearrangeably nonblocking distributors
Constructions of given‐depth and optimal multirate rearrangeably nonblocking distributors
2012,
Rearrangeable multirate multicast switching networks are customarily called...
Dispatching design for storage‐centric wireless sensor networks
Dispatching design for storage‐centric wireless sensor networks
2012,
In a large‐scale storage‐centric wireless sensor network (SWSN) where...
Competent genetic algorithms for weighing matrices
Competent genetic algorithms for weighing matrices
2012,
In this paper, we demonstrate that the search for weighing matrices constructed from...
On the fractionality of the path packing problem
On the fractionality of the path packing problem
2012,
Given an undirected graph G =( N , E ), a subset T of its nodes and an undirected...
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
2012,
Given an edge‐weighted graph G of order n , the minimum cut linear arrangement...
Algebraic connectivity of an even uniform hypergraph
Algebraic connectivity of an even uniform hypergraph
2012,
We generalize Laplacian matrices for graphs to Laplacian tensors for even uniform...
An optimal square coloring of planar graphs
An optimal square coloring of planar graphs
2012,
The square coloring of a graph is to color the vertices of a graph at distance at most...
Online scheduling on uniform machines with two hierarchies
Online scheduling on uniform machines with two hierarchies
2012,
In this paper we study online scheduling problem on m parallel uniform machines with...
LLL‐reduction for integer knapsacks
LLL‐reduction for integer knapsacks
2012,
Given a matrix A ∈ℤ m × n satisfying certain regularity assumptions, a...
The paths embedding of the arrangement graphs with prescribed vertices in given position
The paths embedding of the arrangement graphs with prescribed vertices in given position
2012,
Let n and k be positive integers with n − k ≥2. The arrangement graph A n , k...
The total {k}‐domatic number of wheels and complete graphs
The total {k}‐domatic number of wheels and complete graphs
2012,
Let k be a positive integer and let G be a graph with vertex set V ( G ). The total {...
Vertices in all minimum paired‐dominating sets of block graphs
Vertices in all minimum paired‐dominating sets of block graphs
2012,
Let G =( V , E ) be a simple graph without isolated vertices. A set S ⊆ V is a...
The second largest number of maximal independent sets in connected graphs with at most one cycle
The second largest number of maximal independent sets in connected graphs with at most one cycle
2012,
A maximal independent set is an independent set that is not a proper subset of any...
Min‐cost multiflows in node‐capacitated undirected networks
Min‐cost multiflows in node‐capacitated undirected networks
2012,
We consider an undirected graph G =( VG , EG ) with a set T ⊆ VG of terminals,...
Approximation schemes for two‐machine flow shop scheduling with two agents
Approximation schemes for two‐machine flow shop scheduling with two agents
2012,
In this paper we consider two‐machine flow shop scheduling with two agents. Two...
Long cycles in hypercubes with optimal number of faulty vertices
Long cycles in hypercubes with optimal number of faulty vertices
2012,
Let f ( n ) be the maximum integer such that for every set F of at most f ( n )...
On L(2,1)‐labeling of generalized Petersen graphs
On L(2,1)‐labeling of generalized Petersen graphs
2012,
A variation of the classical channel assignment problem is to assign a radio channel...
Random restricted matching and lower bounds for combinatorial optimization
Random restricted matching and lower bounds for combinatorial optimization
2012,
We prove results on optimal random extensions of trees over points in [0,1] d . As an...
Some results on the injective chromatic number of graphs
Some results on the injective chromatic number of graphs
2012,
A k ‐coloring of a graph G =( V , E ) is a mapping c : V →{1,2,…, k...
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
2012,
Given a directed hypergraph H =( V , E H ), we consider the problem of embedding all...
A Nordhaus‐Gaddum‐type result for the induced path number
A Nordhaus‐Gaddum‐type result for the induced path number
2012,
The induced path number ρ ( G ) of a graph G is defined as the minimum number of...
k‐tuple total domination in cross products of graphs
k‐tuple total domination in cross products of graphs
2012,
For k ≥1 an integer, a set S of vertices in a graph G with minimum degree at least...
Exact combinatorial algorithms and experiments for finding maximum k‐plexes
Exact combinatorial algorithms and experiments for finding maximum k‐plexes
2012,
We propose new practical algorithms to find maximum‐cardinality k...
The complexity of influence maximization problem in the deterministic linear threshold model
The complexity of influence maximization problem in the deterministic linear threshold model
2012,
The influence maximization is an important problem in the field of social network....
Papers per page: