✦ LIBER ✦

A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph

✍ Scribed by Jayaram Bhasker; Sartaj Sahni

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 488 KB
Volume: 17
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230170306

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Linear Time Algorithm for Prope

A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs

✍ Xin He 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper Ž . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr

A dual algorithm for the topology optimi

A dual algorithm for the topology optimization of non-linear elastic structures

✍ C. S. Jog 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

A Linear Time Algorithm for Calculation

A Linear Time Algorithm for Calculation of Multiple Pairwise Kinship Coefficients and the Genetic Index of Familiality

✍ Khosrow Gholami; Alun Thomas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Necessary and sufficient conditions for

Necessary and sufficient conditions for the existence of a common quadratic Lyapunov function for a finite number of stable second order linear time-invariant systems

✍ Robert N. Shorten; Kumpati S. Narendra 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB 👁 3 views

## Abstract In this paper, necessary and sufficient conditions are derived for the existence of a common quadra‐tic Lyapunov function for a finite number of stable second order linear time‐invariant systems. Copyright © 2002 John Wiley & Sons, Ltd.

Convergence analysis of the least-square

Convergence analysis of the least-squares identification algorithm with a variable forgetting factor for time-varying linear systems

✍ Rafael M. Canetti; Martín D. España 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 371 KB

A General Formulation of Discrete-Time Q

A General Formulation of Discrete-Time Quantum Mechanics: Restrictions on the Action and the Relation of Unitarity to the Existence Theorem for Initial-Value Problems

✍ M. Khorrami 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 350 KB 👁 1 views

A general formulation for discrete-time quantum mechanics, based on Feynman's method in ordinary quantum mechanics, is presented. It is shown that the ambiguities present in ordinary quantum mechanics (due to noncommutativity of the operators), are no longer present here. Then the criteria for the u