5889 search results - page 76 / 1178 » Graph Layout Problems |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
JCO
2007
13 years 10 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
BIRTHDAY
2004
Springer
14 years 3 months ago
2004
Springer
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...
IPCO
1993
13 years 11 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
GBRPR
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...