2503 search results - page 294 / 501 » A study of 3-arc graphs |
162
Voted
WG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
149
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
182
click to vote
DATESO
2010
15 years 4 months ago
2010
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
171
click to vote
ERSA
2010
15 years 4 months ago
2010
Abstract--Modeling environments and performance prediction boost application productivity, but often lack integration into an efficient and comprehensive approach to strategic desi...
176
click to vote
AUTOMATICA
2011
15 years 1 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...