𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

✍ Scribed by Paulino, Glaucio H. ;Menezes, Ivan F. M. ;Gattass, Marcelo ;Mukherjee, Subrata

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
867 KB
Volume
10
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some new bounds for the maximum number o
Some new bounds for the maximum number of vertex colorings of a (v,e)-graph
✍ Byer, Owen D. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 3 views

Let f (v, e, Ξ») denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in Ξ» colors. In this paper we present some new upper bounds for f (v, e, Ξ»). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve

A new algorithm for the estimation of pa
A new algorithm for the estimation of parameters in ordinary differential equations
✍ M. Hwang; J. H. Seinfeld πŸ“‚ Article πŸ“… 1972 πŸ› American Institute of Chemical Engineers 🌐 English βš– 382 KB πŸ‘ 2 views

A new computational algorithm for the estimation of parameters in ordinary differential equations from noisy data is presented. The algorithm is computationally faster than quasilinearization because of the reduction of the number of ordinary differential equations that must be solved a t each itera