23 search results - page 5 / 5 » Many-to-Many Graph Matching via Metric Embedding |
STACS
2000
Springer
13 years 8 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
ICDE
2010
IEEE
13 years 7 months ago
2010
IEEE
HECATAEUS is an open-source software tool for enabling impact prediction, what-if analysis, and regulation of relational database schema evolution. We follow a graph theoretic appr...