1105 search results - page 81 / 221 » Linear choosability of graphs |
118
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
145
click to vote
IJCAI
2007
15 years 5 months ago
2007
This paper proposes and develops a new graph-based semi-supervised learning method. Different from previous graph-based methods that are based on discriminative models, our method...
132
click to vote
ENDM
2008
15 years 4 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
160
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
147
click to vote
CIAC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...