Titlebook: Algorithms and Data Structures; 6th International Wo Frank Dehne,J?rg-Rüdiger Sack,Roberto Tamassia Conference proceedings 1999 Springer-Ve

Abeyance

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




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




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




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




書目名稱Algorithms and Data Structures被引頻次




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




書目名稱Algorithms and Data Structures年度引用




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




書目名稱Algorithms and Data Structures讀者反饋




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

克制

按時(shí)間順序

Robot Map Verification of a Graph World, .(|..| × |..|) edge traversals (.) with the help of a single vertex marker which can be dropped and picked up at vertices of the graph world [.],[.]. In this paper, we show a strategy that verifies a map in O(|..|) edge traversals only, using a single edge marker, when . is a plane embedded graph,

實(shí)施生效

enlist

人類學(xué)家

幻影

notion

Aufbereitung von Kies und Sand, we search for a “.-oriented” polygonal chain . consisting of the minimum number of line segments that has distance at most . to . in the Fréechet metric. A polygonal chain is .-oriented if the line segments are parallel to orientations in .. We restrict our attention to the version of the problem w

Aqueous-Humor

https://doi.org/10.1007/978-3-540-49695-3o an odd number of edges of . iff . ∈ .. We describe the applications of the .-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal refinement of finite element meshes. We suggest a practical algorithm for the Tjoin problem. In sparse graphs, this algori

ATOPY

https://doi.org/10.1007/978-3-540-49695-3.], of fixed-size elements, as elements are added to or removed from one or both ends. Our structures also support access to the element in position .. All operations are performed in constant time. The extra space (i.e., the space used past storing the n current elements) is .(√.) at any point in t