On the determination of planar graphs.
MetadataShow full item record
Various algorithms for testing the planarity of a graph are reviewed. The Phung-Chan algorithm is improved by modifying the method of application of the necessary and sufficient condition that a pseudo-Hamiltonian graph be planar and the method of determination of circuit C(k) with as many edges as possible, and from which the pseudo- Hamiltonian graph is defined. By application of the proposed algorithm it is proved that the algorithm can be applied to an arbitrary graph. Using this proposed algorithm, the rate of convergence of the algorithm is increased and the computer storage requirement is minimized.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Johnson, Brian E (Monterey, California. Naval Postgraduate School, 1997-12);In this thesis we present an algorithm for the precise determination of the Mie extinction efficiency parameter. The mathematical representation of the Mie parameters is in the form of an infinite series, and any technique ...
A Simplified Quaternion-Based Algorithm for Orientation Estimation From Earth Gravity and Magnetic Field Measurements Yun, Xiaoping; Bachmann, Eric R.; McGhee, Robert B. (2008-03);Orientation of a static or slow-moving rigid body can be determined from the measured gravity and local magnetic field vectors. Some formulation of the QUaternion ESTimator (QUEST) algorithm is commonly used to solve ...
Geddes, John M. Jr. (1986-09);This thesis extends the development of algorithms for modeling planning processes in the AirLand Research Model (ALARM), an on-going research effort at the Naval Postgraduate School. An algorithm is developed to determine ...