68 search results - page 7 / 14 » TALE: A Tool for Approximate Large Graph Matching |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
FCCM
2011
IEEE
12 years 11 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
BMCBI
2008
13 years 7 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...