Sciweavers

26 search results - page 2 / 6
» wg 2007
Sort
View
ESCIENCE
2007
IEEE
13 years 11 months ago
Peer-to-Peer Based Grid Workflow Runtime Environment of SwinDeW-G
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...
WG
2007
Springer
13 years 11 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
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...
Bruno Escoffier, Laurent Gourvès, Jé...
WG
2007
Springer
13 years 11 months ago
Pathwidth of Circular-Arc Graphs
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...
Karol Suchan, Ioan Todinca
WG
2007
Springer
13 years 11 months ago
NLC-2 Graph Recognition and Isomorphism
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ë...
WG
2007
Springer
13 years 11 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...