Information Processing Letters, Volume 122
Volume 122, June 2017
- Min-Sheng Lin, Chien-Min Chen:
Linear-time algorithms for counting independent sets in bipartite permutation graphs. 1-7 - Toni Mancini, Federico Mari, Annalisa Massini, Igor Melatti, Ivano Salvo, Enrico Tronci:
On minimising the maximum expected verification time. 8-16 - Nikhil Bansal, Seeun William Umboh:
Tight approximation bounds for dominating set on graphs of bounded arboricity. 21-24 - Izak Broere, Gabriel Semanisin:
Some bounds on the generalised total chromatic number of degenerate graphs. 30-33