ROLE
Author only
BOOKMARK & SHARE


1
January 2014
Discrete Applied Mathematics: Volume 162 Issue C, January 2014
Publisher: Elsevier Science Publishers B. V.
In 23], Klav�ar and Milutinović (1997) proved that there exist at most two different shortest paths between any two vertices in Sierpiński graphs S k n , and showed that the number of shortest paths between any fixed pair of vertices of S k n can be computed in O ...
Keywords:
Almostextreme vertex, Shortest path, Sierpiński graph
2
May 2013
Graphs and Combinatorics: Volume 29 Issue 3, May 2013
Publisher: SpringerVerlag
The linear arboricity la ( G ) of a graph G is the minimum number of linear forests which partition the edges of G . In this paper, it is proved that for a planar graph G , $${la(G)=\lceil\frac{\Delta(G)}{2}\rceil}$$ if Δ( G ) � 7 and G has no 5cycles ...
Keywords:
Linear arboricity, Planar graph, Cycle
3
August 2012
Discrete Applied Mathematics: Volume 160 Issue 12, August, 2012
Publisher: Elsevier Science Publishers B. V.
A mapping @f from V(G) to {1,2,...,t} is called a pathtcoloring of a graph G if each G[@f^^1(i)], for [email protected][email protected]?t, is a linear forest. The vertex linear arboricity of a graph G, denoted by vla(G), is the minimum t for which G has a path tcoloring. Graphs S[n,k] are obtained ...
Keywords:
Hamiltonicity, Sierpiński graph, Vertex linear arboricity, Matching, Path tcoloring
4
November 2011
Theoretical Computer Science: Volume 412 Issue 48, November, 2011
Publisher: Elsevier Science Publishers Ltd.
The problem of Minimum Congestion Hypergraph Embedding in a Weighted Cycle (MCHEWC) is to embed the hyperedges of a hypergraph as paths in a weighted cycle such that the maximum congestion is minimized. This problem is NPhard. In this paper, we present a polynomial time approximation scheme (PTAS) for this ...
Keywords:
Minimum congestion, NPhard, Weighted cycle, Hypergraph embedding, Polynomial time approximation scheme
5
August 2010
FAW'10: Proceedings of the 4th international conference on Frontiers in algorithmics
Publisher: SpringerVerlag
The problem of Minimum Congestion Hypergraph Embedding in a Weighted Cycle (MCHEWC) is to embed the hyperedges of a hypergraph as paths in a weighted cycle such that the maximum congestion, i.e. the maximum product of the weight of an edge and the number of times that the edge is ...
Keywords:
polynomial time approximation scheme, hypergraph embedding, minimum congestion, NPhard, weighted cycle
6
March 2009
ACM Transactions on Algorithms (TALG): Volume 5 Issue 2, March 2009
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1, Downloads (12 Months): 10, Downloads (Overall): 290
Full text available:
PDF
We consider the problem of embedding hyperedges of a hypergraph as paths in a cycle such that the maximum congestion, namely the maximum number of paths that use any single edge in a cycle, is minimized. The minimum congestion hypergraph embedding in a cycle problem is known to be NPhard ...
Keywords:
minimum congestion, NPhard, polynomialtime approximation scheme, Hypergraph embedding
7
February 2009
Journal of Computational and Applied Mathematics: Volume 224 Issue 1, February, 2009
Publisher: Elsevier Science Publishers B. V.
This paper is concerned with a kind of QPfree feasible algorithm which solves an inequality constrained nonlinear optimization problem. Under some weaker conditions than those in [H. Qi, L. Qi, A New QPfree, globally convergent, locally superlinear convergent algorithm for inequality constrained optimization, SIAM J. Optim. 11 (2000) 113132], we ...
Keywords:
QPfree, Linear independence, Constrained optimization, Convergence, Smoothing function
8
August 2008
Algorithmica: Volume 51 Issue 4, August 2008
Publisher: SpringerVerlag New York, Inc.
To fully utilize all available information in protein structure prediction, including both backbone and sidechain structures, we present a novel algorithm for solving a generalized threading problem. In this problem, we consider simultaneously backbone threading and sidechain packing during the process of a protein structure prediction. For a given query ...
Keywords:
Backbone, Sidechain, Algorithm, Protein threading
9
May 2008
Algorithmica: Volume 51 Issue 4, May 2008
Publisher: SpringerVerlag New York, Inc.
To fully utilize all available information in protein structure prediction, including both backbone and sidechain structures, we present a novel algorithm for solving a generalized threading problem. In this problem, we consider simultaneously backbone threading and sidechain packing during the process of a protein structure prediction. For a given query ...
Keywords:
Algorithm, Protein threading, Backbone, Sidechain
10
December 2007
CISW '07: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops
Publisher: IEEE Computer Society
Jobs share a common due window and belong to distinct families with sequenceindependent setup tasks on a sin gle machine. The window location and size are decision variables with linear penalties. Our objective is to find a schedule minimizing the sum of the weighted number of early and tardy jobs, ...
11
August 2007
Algorithmica: Volume 48 Issue 4, August 2007
Publisher: SpringerVerlag New York, Inc.
To utilize fully all available information in protein structure prediction, including both backbone and sidechain structures, we present a novel algorithm for solving a generalized threading problem. In this problem we consider simultaneous backbone threading and sidechain packing during the process of a protein structure prediction. For a given query ...
12
August 2007
FAW'07: Proceedings of the 1st annual international conference on Frontiers in algorithmics
Publisher: SpringerVerlag
Let G be a 3connected graph and e an edge of G . If, by deleting e from G , the resultant graph Ge is a 3connected graph or a subdivision of a 3connected graph, then e is called a removable edge of G . In this paper we obtain ...
Keywords:
removable edge, 3connected 3regular graph, edgevertexcut fragment
13
May 2007
ICCS '07: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Publisher: SpringerVerlag
The vertex set of a digraph D is denoted by V ( D ). A c partite tournament is an orientation of a complete c partite graph. Let V 1 , V 2 ,..., V c be the partite sets of D . If there exist two vertex disjoint cycles ...
Keywords:
tournament, almost regular, componentwise complementary cycles
14
September 2006
FSKD'06: Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Publisher: SpringerVerlag
A common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. The processing time of a batch is defined as the longest processing time among the jobs in the batch. This model is motivated by applications ...
Keywords:
scheduling, batch, due window, earliness, tardiness
15
July 2005
Journal of Combinatorial Theory Series B: Volume 94 Issue 2, July 2005
Publisher: Academic Press, Inc.
16
April 2005
Discrete Applied Mathematics: Volume 148 Issue 1, 30 April 2005
Publisher: Elsevier Science Publishers B. V.
We consider the problem of scheduling n jobs on m identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B(B
Keywords:
Identical parallel batching machines, Makespan, Polynomial time approximation scheme, Scheduling
17
April 2005
Discrete Applied Mathematics: Volume 148 Issue 1, 30 April 2005
Publisher: Elsevier Science Publishers B. V.
We consider the problem of scheduling n jobs on m identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n) jobs as a batch simultaneously. The processing time of a batch is equal to ...
Keywords:
identical parallel batching machines, makespan, scheduling, polynomial time approximation scheme
18
March 2005
Operations Research Letters: Volume 33 Issue 2, March, 2005
Publisher: Elsevier Science Publishers B. V.
We consider the problem of scheduling jobs with release times and nonidentical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worstcase ratio [email protected], where @e>0 can be made arbitrarily small.
Keywords:
Approximation algorithms, Batch processing, Release times, Scheduling, Makespan
19
July 2004
Journal of Combinatorial Theory Series B: Volume 91 Issue 2, July 2004
Publisher: Academic Press, Inc.
Grillet established conditions on a partially ordered set under which each maximal antichain meets each maximal chain. Chvátal made a conjecture in terms of graphs that strengthens Grillet's theorem. The purpose of this paper is to prove this conjecture.
20
April 2003
Journal of Algorithms: Volume 47 Issue 1, April 2003
Publisher: Academic Press, Inc.
A tree of rings is an undirected graph obtained from a tree by replacing each node of the tree with a cycle (called treenodecycle) and then contracting the edges of the tree so that two cycles corresponding to the two endnodes of any edge have precisely one node in common ...
Keywords:
approximation algorithms, trees of rings, path coloring

