4865 search results - page 198 / 973 » The Complexity of Graph Connectivity |
188
click to vote
SIAMDM
2010
15 years 4 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
177
click to vote
ITA
2006
15 years 6 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
146
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
160
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
185
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...