4865 search results - page 34 / 973 » The Complexity of Graph Connectivity |
JPDC
2007
13 years 10 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
GBRPR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
JCT
2006
13 years 10 months ago
2006
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
ENDM
2002
13 years 10 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer