Perfect Distance-d Placements in 2D Toroidal Networks

Author： Albdaiwi Bader F.   Livingston Marilynn L.  

Publisher： Springer Publishing Company

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.29, Iss.1, 2004-07, pp. : 45-57

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

$\Phi $ -functions for complex 2D-objects

By Stoyan Yurij  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 2, Iss. 1, 2004-03 ,pp. : 69-84

Springer Publishing Company

Access to resources Recommend Favorite

The D-Decomposition Theory

By Gryazina E. N.  

Automation and Remote Control, Vol. 65, Iss. 12, 2004-12 ,pp. : 1872-1884

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Hierarchical Extension of the D* Algorithm

By Cagigas Daniel   Abascal Julio  

Journal of Intelligent and Robotic Systems, Vol. 42, Iss. 4, 2005-04 ,pp. : 393-413

Springer Publishing Company

Access to resources Recommend Favorite

Recognizing d -Interval Graphs and d -Track Interval Graphs

By Jiang Minghui  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 541-563

Springer Publishing Company

Access to resources Recommend Favorite

Bounding the Distance between 2D Parametric Bézier Curves and their Control Polygon

By Karavelas M. I.   Kaklis P. D.   Kostas K. V.  

Computing, Vol. 72, Iss. 1-2, 2004-04 ,pp. : 117-128

Springer Publishing Company

Access to resources Recommend Favorite