Sciweavers

1986 search results - page 153 / 398
» Path Separability of Graphs
Sort
View
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
14 years 2 months ago
Learning dynamic temporal graphs for oil-production equipment monitoring system
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
Yan Liu, Jayant R. Kalagnanam, Oivind Johnsen
ALGORITHMICA
2011
13 years 5 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
DM
2010
132views more  DM 2010»
13 years 10 months ago
Diameter and connectivity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
Martin Knor, Sanming Zhou
GC
2008
Springer
13 years 10 months ago
Domination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
Christian Löwenstein, Dieter Rautenbach
PVLDB
2010
152views more  PVLDB 2010»
13 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...