92 search results - page 12 / 19 » Linked graphs with restricted lengths |
TCOM
2008
13 years 7 months ago
2008
In this article, we present a novel discrete-time Markov chain model of book-ahead bandwidthsharing mechanisms. We use this analytical model and a simulation model to understand t...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
MPC
2010
Springer
13 years 9 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
ISAAC
2004
Springer
14 years 25 days ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...