𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph Pairs and their Entropies: Modularity Problems

✍ Scribed by János Körner; Gábor Simonyi

Book ID
106167869
Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
210 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized entropy optimization problem
Generalized entropy optimization problems and the existence of their solutions
✍ Aladdin Shamilov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 172 KB

In the present study we have formulated a generalization of entropy optimization problems (GEOP), proposed sufficient conditions for the existence of solution. We have suggested also a new method based on a priori evaluations and Newton's methods for calculation of Langrange multipliers. Mentioned m

Solving the all-pair shortest path query
Solving the all-pair shortest path query problem on interval and circular-arc graphs
✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently