3008 search results - page 28 / 602 » Independence in connected graphs |
108
Voted
AAAI
2008
15 years 3 months ago
2008
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
117
Voted
KDD
2005
ACM
15 years 6 months ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
103
Voted
DM
2010
15 years 23 days ago
2010
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 ...
116
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
69
Voted
DM
2008
15 years 22 days ago
2008
We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).