796 search results - page 91 / 160 » The Anonymous Subgraph Problem |
137
Voted
ALGORITHMICA
2010
14 years 11 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
91
Voted
COLCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
—In many applications, transaction data arrive in the form of high speed data streams. These data contain a lot of information about customers that needs to be carefully managed ...
114
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
115
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
131
Voted
WADS
1993
Springer
15 years 4 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...