5100 search results - page 427 / 1020 » The Linear Complexity of a Graph |
200
Voted
ICC
2007
IEEE
16 years 2 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
187
Voted
WABI
2007
Springer
16 years 1 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
229
Voted
WAW
2007
Springer
16 years 1 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
210
click to vote
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
205
Voted
ICCS
1998
Springer
15 years 12 months ago
1998
Springer
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...