723 search results - page 49 / 145 » On the hyperbolicity constant in graphs |
162
click to vote
WG
2009
Springer
16 years 27 days ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
144
click to vote
COCO
2007
Springer
16 years 14 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
155
click to vote
FOCS
2006
IEEE
16 years 10 days ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
165
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
161
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...