Nowadays, grid and peer-to-peer (p2p) technologies have become popular solutions for large-scale resource sharing and system integration. For e-science workflow systems, grid is a...
Yun Yang, Ke Liu, Jinjun Chen, Joel Lignier, Hai J...
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
Vincent Limouzy, Fabien de Montgolfier, Michaë...
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...