Median graph

Known as: Median network 
In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2016
0519842016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • figure 2
  • table I
  • table I
Is this relevant?
2010
2010
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a… (More)
Is this relevant?
2009
2009
In this paper, we study different classes of intersection graphs of maximal hypercubes of median graphs. For a median graph G and… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
We study the so-called Generalized Median graph problem where the task is to to construct a prototype (i.e., a 'model') from an… (More)
  • figure 1
  • figure 3
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… (More)
  • table 4
  • table 1
  • figure 1
  • figure 3
Is this relevant?
2005
2005
In pattern recognition, median computation is an important technique for capturing the important information of a given set of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2003
2003
Median graph is an important new concept introduced to represent a set of graphs by a representative graph. Computing the median… (More)
  • figure 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
1999
1999
Let M(m,n) be the complexity of checking whether a graph G with m edges and n vertices is a median graph. We show that the… (More)
  • figure 1
  • figure 2
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… (More)
  • figure 1
  • figure 2
Is this relevant?