3008 search results - page 27 / 602 » Independence in connected graphs |
168
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
148
click to vote
MFCS
1992
Springer
15 years 10 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
128
click to vote
DM
2002
15 years 5 months ago
2002
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
220
click to vote
OL
2011
15 years 29 days ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
224
click to vote
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...