Titlebook: Algorithms and Computation; 22nd International S Takao Asano,Shin-ichi Nakano,Osamu Watanabe Conference proceedings 2011 Springer-Verlag Gm

MEET

壯麗的去

https://doi.org/10.1007/978-3-662-26424-9=?(.,.), denoted as .., is a graph with the set of vertices ., in which two vertices are connected by an edge if there exists a path of length at most 2 connecting them in .. Harary & Schwenk (1971) proved that the square of a tree . contains a Hamiltonian cycle if and only if . is a caterpillar, i.

Constant

物質(zhì)

https://doi.org/10.1007/978-3-662-34644-0 such that .. connects .. and .., for .?=?1,…,.. We study a natural variant of this problem, where the vertices of .. must belong to a specified vertex subset .. for .?=?1,…,.. In contrast to the original problem, which is polynomial-time solvable for any fixed integer ., we show that this variant i

Projection

引導(dǎo)

GET

寬宏大量

BUOY

Elemente und Strukturen des Kriminalromans,n integer .?>?0, return the .-th smallest .-coordinate from the set of points that have .-coordinates in .. We present a linear space data structure that maintains a dynamic set of . points in the plane with real coordinates, and supports range selection queries in . time, as well as insertions and

GENUS

https://doi.org/10.1007/978-3-476-03896-8re uses linear space and supports insertions and deletions in .(log.) and .(log./loglog.) amortized time respectively..We also describe a .(.(log./loglog.).) space data structure that answers .-dimensional stabbing-max queries in .( (log./loglog.).) time. Insertions and deletions are supported in .(