1201 search results - page 54 / 241 » Linear Probing and Graphs |
112
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
125
click to vote
TIT
2008
15 years 4 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
118
click to vote
STOC
1990
ACM
15 years 8 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
130
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
102
click to vote
IMA
2001
Springer
15 years 8 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...