5100 search results - page 122 / 1020 » The Linear Complexity of a Graph |
IPL
2006
13 years 9 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
ALGORITHMICA
2002
13 years 9 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
WG
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
CCECE
2006
IEEE
14 years 3 months ago
2006
IEEE
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper proposes a new blind equalization scheme based on widely linear (WL) prediction. It permits to compensate non-minimum phase channels with or without spectral nulls, ...