219 search results - page 18 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
110
click to vote
CINQ
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
112
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
111
click to vote
DAM
2010
15 years 1 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
157
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
100
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...