1395 search results - page 211 / 279 » (k, )-Distance-Hereditary Graphs |
129
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
163
click to vote
TALG
2008
15 years 4 months ago
2008
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 a k-le...
159
click to vote
NETWORKS
2010
15 years 2 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
165
Voted
SETA
2004
Springer
15 years 10 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
195
Voted
CONEXT
2009
ACM
15 years 5 months ago
2009
ACM
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...