5889 search results - page 51 / 1178 » Graph Layout Problems |
STACS
2009
Springer
14 years 4 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
EVOW
2006
Springer
14 years 1 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
COCO
2010
Springer
13 years 7 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
FSTTCS
2005
Springer
14 years 3 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...