Ausgabe 4/2014
Inhalt (12 Artikel)
A lower bound of the surviving rate of a planar graph with girth at least seven
Weifan Wang, Stephen Finbow, Ping Wang
Hardness results and approximation algorithm for total liar’s domination in graphs
B. S. Panda, S. Paul
Bandwidth sums of block graphs and cacti
Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo, Ji-Yin Lin, Jing-Ho Yan
Paired versus double domination in K 1,r -free graphs
Paul Dorbec, Bert Hartnell, Michael A. Henning
Algorithms with limited number of preemptions for scheduling on parallel machines
Yiwei Jiang, Zewei Weng, Jueliang Hu
The cost of selfishness for maximizing the minimum load on uniformly related machines
Leah Epstein, Elena Kleiman, Rob van Stee
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
Shihyen Chen, Kaizhong Zhang
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Jay Mahadeokar, Sanjeev Saxena
Solving the Multidimensional Assignment Problem by a Cross-Entropy method
Duc Manh Nguyen, Hoai An Le Thi, Tao Pham Dinh