3204 search results - page 191 / 641 » The Alcuin Number of a Graph |
354
click to vote
AAIM
2011
Springer
14 years 9 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
153
click to vote
ICC
2007
IEEE
16 years 10 days ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
183
click to vote
FCT
2007
Springer
15 years 7 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
154
click to vote
JGAA
2007
15 years 5 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
150
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...