scispace - formally typeset
Open AccessBook

Distance in graphs

Fred Buckley, +1 more
About
The article was published on 1990-01-01 and is currently open access. It has received 1185 citations till now. The article focuses on the topics: Graph theory & Convexity.

read more

Citations
More filters
Proceedings Article

Add-A-Tag: Learning Adaptive User Profiles from Bookmark Collections

TL;DR: This paper constructs adaptive user profiles from tagging data and presents and evaluates an algorithm for creating such profiles, characterizing its behavior through statistical analysis.
Journal ArticleDOI

The simplex geometry of graphs

TL;DR: A novel approach to study graphs is discussed: the simplex geometry (a simplex is a generalized triangle), proposed by Miroslav Fiedler, which introduces techniques from (simplex) geometry into the field of graph theory and conversely, via an exact correspondence.
Journal ArticleDOI

Inequalities for entropy-based measures of network information content

TL;DR: This paper presents a method for establishing relations between entropy-based measures applied to graphs and a special class of relations called implicit information inequalities or implicit entropy bounds is developed.
Journal ArticleDOI

Spatial Topology and its Structural Analysis based on the Concept of Simplicial Complex

TL;DR: In this paper, a model that identifies spatial relationships for structural analysis based on the concept of simplicial complex is introduced. But the model relies on the simplical complex for structural representation and analysis.
Journal ArticleDOI

Weak vs. Self vs. Probabilistic Stabilization

TL;DR: It is formally proved that in that sense, weak stabilization is strictly stronger that self-stabilization, and refined previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-st stabilizing protocol can be turned into a probabilistic self-Stabilizing one.