Titlebook: WALCOM: Algorithms and Computation; 7th International Wo Subir Kumar Ghosh,Takeshi Tokuyama Conference proceedings 2013 Springer-Verlag Ber

明智的人

Counting Maximal Points in a Query Orthogonal Rectangle problem has been previously studied in [3]and [5]. To the best of our knowledge, this is the first sub-logarithmic query time solution for the problem. Our model of computation is the word RAM with word size of Θ(log.) bits.

Outspoken

許可

BLAND

Voronoi Game on Graphscing their facilities. The objective of each player is to maximize the region occupied on the underlying space. In this paper we consider one round . with two players. Here the underlying space is a road network, which is modeled by a graph embedded on ?.. In this game each of the players places a s

昆蟲(chóng)

Foment

magnanimity

斗志

Hallowed

Exact and Approximation Algorithms for Densest ,-Subgraphrch among the subsets of . vertices of . one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of .-SUBGRAPH improving the trivial exponential time complexity of?..(2.) and using polynomial space. Two?FPT algorithms are also proposed; the first cons

Canary