4865 search results - page 361 / 973 » The Complexity of Graph Connectivity |
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
172
click to vote
JDA
2008
15 years 6 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
167
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
168
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...
175
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...