Titlebook: Algorithms and Computation; 18th International S Takeshi Tokuyama Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Algori

Enkephalin

書目名稱Algorithms and Computation影響因子(影響力)




書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名




書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度




書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithms and Computation被引頻次




書目名稱Algorithms and Computation被引頻次學(xué)科排名




書目名稱Algorithms and Computation年度引用




書目名稱Algorithms and Computation年度引用學(xué)科排名




書目名稱Algorithms and Computation讀者反饋




書目名稱Algorithms and Computation讀者反饋學(xué)科排名

衣服

Coloring Triangle-Free Graphs on Surfaces abstract is to describe a new result along these lines..By a . we mean a compact 2-dimensional manifold with empty boundary. The classification theorem of surfaces states that every surface is homeomorphic to either the surface .. obtained from the sphere by adding . handles (“the orientable surfac

隱藏

Integer Representation and Counting in the Bit Probe Modelcan be performed using few bit inspections and fewer bit changes. In particular, we prove a new lower bound of . for the increment and decrement operation, where . is the minimum number of bits required to represent the number. The model of computation we considered is the bit probe model, where the

HEED

Minimum Degree Orderings, and that a minimum cut in a graph can be found by repeatedly contracting a pendent pair, yielding one of the fastest and simplest minimum cut algorithms. In this paper, we provide another ordering of vertices, called a minimum degree ordering (MD ordering) as a new fundamental tool to analyze the

無(wú)聊點(diǎn)好

Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected.., where .. and .. denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph . asks to find a set . of vertices minimizing ∑?..(.) such that there are at least .(.) pairwise vertex-disjoi

limber

CLOT

柱廊

Escaping Off-Line Searchers and a Discrete Isoperimetric Theoremtion indefinitely? We study the number of searchers against which the target can still escape. This is less than . in an .×. grid, since a row of searchers can sweep the allowed region..In an alternating move model where at each time first all searchers move and then the target moves, we show that a

反感

排出