Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex… Expand

Is this relevant?

2010

2010

In the context of unsupervised clustering, a new algorithm for the domain of graphs is introduced. In this paper, the key idea is… Expand

Is this relevant?

2009

2009

In this thesis, we study the k-median problem with respect to a dissimilarity measure Dφ from the family of Bregman divergences… Expand

Is this relevant?

2009

2009

A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function… Expand

Is this relevant?

2006

2006

In this paper, we are interested in the problem of graph clustering. We propose a new algorithm for computing the median of a set… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

In object prototype learning and similar tasks, median computation is an important technique for capturing the essential… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

Feeding by juvenile Antarctic krill Euphausia superba near South Georgia was assessed during the austral summer of 1995/1996. Gut… Expand

Is this relevant?

1984

1984

A median of a family of vertices in a graph is any vertex whose distance-sum to that family is minimum. In the framework of… Expand

Is this relevant?

1980

1980

The n-cube is characterized as a connected regular graph in which for any three vertices u, v, and w there is a unique vertex… Expand

Is this relevant?

Highly Cited

1978

Highly Cited

1978

Abstract A median graph is a connected graph, such that for any three vertices u , ν and w there is exactly one vertex x that… Expand

Is this relevant?