3105 search results - page 419 / 621 » The Path-Packing Structure of Graphs |
120
click to vote
CEAS
2006
Springer
15 years 7 months ago
2006
Springer
We address the problem of suggesting who to add as an additional recipient (i.e. cc, or carbon copy) for an email under composition. We address the problem using graphical models ...
131
click to vote
FCT
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
130
click to vote
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
115
click to vote
AAAI
2007
15 years 6 months ago
2007
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...
120
click to vote
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...