Titlebook: Algorithms and Data Structures; 12th International S Frank Dehne,John Iacono,Jörg-Rüdiger Sack Conference proceedings 2011 Springer-Verlag

Dangle

书目名称Algorithms and Data Structures影响因子(影响力)




书目名称Algorithms and Data Structures影响因子(影响力)学科排名




书目名称Algorithms and Data Structures网络公开度




书目名称Algorithms and Data Structures网络公开度学科排名




书目名称Algorithms and Data Structures被引频次




书目名称Algorithms and Data Structures被引频次学科排名




书目名称Algorithms and Data Structures年度引用




书目名称Algorithms and Data Structures年度引用学科排名




书目名称Algorithms and Data Structures读者反馈




书目名称Algorithms and Data Structures读者反馈学科排名

Magnitude

pulse-pressure

On the Area Requirements of Euclidean Minimum Spanning Trees,uclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that .. ×.. area is sometimes required to embed an .-vertex tree of maximum degree 5 as a Euclidean minimum spanning tree, for some constant . > 1. In this paper, we prove th

笨拙处理

acetylcholine

Cocker

How to Cover a Point Set with a V-Shape of Minimum Width,lel rays that emanate from two points ., ., are contained in the strip boundaries, and are mirror-symmetric with respect to the line .. The width of a balanced V-shape is the width of the strips..We first present an .(.. log.) time algorithm to compute, given a set of . points ., a minimum-width bal

旧式步枪

Witness Rectangle Graphs, . and . as opposite corners contains at least one point in .. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers..We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the d

PURG

遗忘

TOXIN