4865 search results - page 664 / 973 » The Complexity of Graph Connectivity |
164
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
148
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
153
click to vote
APVIS
2006
15 years 6 months ago
2006
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-s...
130
click to vote
UAI
2004
15 years 6 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
126
Voted
IJCAI
1993
15 years 6 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...