4865 search results - page 434 / 973 » The Complexity of Graph Connectivity |
154
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
180
click to vote
IJWGS
2006
15 years 6 months ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
176
click to vote
IPL
2010
15 years 5 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
149
click to vote
APPML
2007
15 years 7 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
186
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...