1722 search results - page 42 / 345 » On the sample mean of graphs |
74
Voted
GD
2004
Springer
15 years 5 months ago
2004
Springer
The efforts put into XML-related technologies have exciting consequences for XML-based graph data formats such as GraphML. We here give a systematic overview of the possibilities ...
107
click to vote
BIRTHDAY
2008
Springer
15 years 2 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
95
Voted
ENDM
2007
15 years 13 days ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
119
click to vote
VIS
2005
IEEE
16 years 1 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
136
Voted
ALT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...