5889 search results - page 101 / 1178 » Graph Layout Problems |
131
click to vote
SEMWEB
2009
Springer
15 years 8 months ago
2009
Springer
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
117
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
105
click to vote
IPL
2006
15 years 2 months ago
2006
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
119
click to vote
JCO
1998
15 years 1 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
143
click to vote
JGAA
2007
15 years 2 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...