5473 search results - page 66 / 1095 » On the graph isomorphism problem |
FOCS
2005
IEEE
15 years 5 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
14 years 11 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
15 years 5 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...
120
click to vote
IPCO
1993
15 years 1 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...
107
click to vote
KDD
2009
ACM
16 years 13 days ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...