๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A polynomial time algorithm for finding the absolute center of a network

โœ Scribed by Edward Minieka

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
237 KB
Volume
11
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The absolute center of a network
The absolute center of a network
โœ Dov Dvir; Gabriel Y. Handler ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 307 KB
A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
โœ Jay Sethuraman; Chung-Piaw Teo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A Genetic Algorithm for Finding the Page
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
โœ Nidhi Kapoor; Mark Russell; Ivan Stojmenovic; Albert Y. Zomaya ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 151 KB

A ''book-embedding'' of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ''pagenumber'' of a graph is the thickness of the small