Let P be a simple polygon with n vertices. The dual graph T ∗ of a triangulation T of P is the graph whose vertices correspond to the bounded faces of T and whose edges connect those faces of T that share an edge. We consider triangulations of P that minimize or maximize the diameter of their dual graph. We show that both triangulations can be constructed in O(n3 log n) time using dynamic progr...

Alon, Gyárfás and Ruszinkó [1] established a bound for the minimum number of edges that have to be added to a graph of n ≥ n0 vertices in order to obtain a graph of diameter 2. Alon et al. approximated n0 by a polynomial function of the maximum degree of the initial graph. They conjectured that the minimum value for n0 is 12 for the case of Cn, as opposed to n0 = 274 obtained by calculations fo...

This document describes a mechanism to enable specific Diameter proxies to remain in the path of all message exchanges constituting a Diameter session.

Bulk quantities of electrically conducting nanotubes of polypyrrole having narrow pore diameter (6 nm) can be synthesized rapidly by chemical oxidative polymerization of pyrrole in the presence of stoichiometric amounts of V2O5 nanofibers. The V2O5 nanofibers act as templates for polymerization and yield, as the initial product, polypyrrole nanotubes with pores filled with V2O5. The V2O5 dissol...

This document describes the framework, messages, and procedures for the Diameter Quality-of-Service (QoS) application. The Diameter QoS application allows network elements to interact with Diameter servers when allocating QoS resources in the network. In particular, two modes of operation, namely "Pull" and "Push", are defined.

The Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We examine two variants of this problem where the input comes with another parameter k. In the first variant, called BPDC, k upper bounds the total number of edges to be added and in the second, called BFPDC, k upper bounds the ...

A graph is called vertex diameter critical if its diameter increases when any vertex is removed. Regular vertex diameter critical graphs of every valency k ≥ 2 and diameter d ≥ 2 exist, raising the question of identifying the smallest such graphs. We describe an infinite family of k-regular vertex diameter critical graphs of diameter d with at most kd+ (2k − 3) vertices. This improves the previ...

The size of the cornea is important in the diagnosis of primary infantile glaucoma. Reference values regarding eyes of premature infants are scarce. Such data are of special importance in areas such as the Middle East where infantile glaucoma is common and often evident already at birth. The authors have measured the horizontal corneal diameter of the eyes of 127 premature Saudi infants with a ...

Background: One of the key objectives is to update knowledge in order to develop treatment and care recommendations based on research findings. The purpose of the present meta-analysis was to compare the survival rate of narrow dental implants (NDI) with standard dental implants (SDI).    Methods: The international databases targeted for conducting a broad search included PubMed (Medline), Sco...