Titlebook: WALCOM: Algorithms and Computation; 4th International Wo Md. Saidur Rahman,Satoshi Fujita Conference proceedings 2010 Springer-Verlag Berli

難免

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




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




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




書目名稱WALCOM: Algorithms and Computation網(wǎng)絡公開度學科排名




書目名稱WALCOM: Algorithms and Computation被引頻次




書目名稱WALCOM: Algorithms and Computation被引頻次學科排名




書目名稱WALCOM: Algorithms and Computation年度引用




書目名稱WALCOM: Algorithms and Computation年度引用學科排名




書目名稱WALCOM: Algorithms and Computation讀者反饋




書目名稱WALCOM: Algorithms and Computation讀者反饋學科排名

制造

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motiond motion in .(....(.log.?+?log.)) time. If only translation is considered then the existence of a match can be tested in .(... log.) time. The salient feature of our algorithm for the rigid motion and translation is that it avoids the use of intersection of high degree curves.

cluster

冒煙

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Cliquehigh density and for very large and sparse graphs, even though MCS is not designed for any particular type of graphs. MCS can be faster than MCR by a factor of more than 100,000 for some extremely dense random graphs.

Contend

Acyclically 3-Colorable Planar Graphsy planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such that every 3-coloring is acyclic and we provide a linear-time recognition algorithm for such graphs.

斷斷續(xù)續(xù)

Acyclically 3-Colorable Planar Graphsy planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such that every 3-coloring is acyclic and we provide a linear-time recognition algorithm for such graphs.

cartilage

Exclaim

On Some Simple Widthsass . of cographs we show that .-width is NP-complete. We show that the recognition is fixed-parameter tractable, and we show that there exists a finite obstruction set. We introduce simple-width as an alternative for rankwidth and we characterize the graphs with simple-width at most two.

Psychogenic

Range-Of-Motion