990 search results - page 107 / 198 » Sub-Graphs of Complete Graph |
ISAAC
2004
Springer
14 years 1 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, ...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
PageRank-style authority analyses of Web graphs are of great importance for Web mining. Such authority analyses also apply to hot “Web 2.0” applications that exhibit a natural...
OOPSLA
1999
Springer
13 years 12 months ago
1999
Springer
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
DISOPT
2010
13 years 7 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
AMAI
2005
Springer
13 years 7 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...