3268 search results - page 367 / 654 » The hub number of a graph |
182
click to vote
ICCV
2007
IEEE
16 years 29 days ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
166
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
201
click to vote
PKDD
2007
Springer
16 years 23 days ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
180
click to vote
WADS
2007
Springer
16 years 23 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
142
click to vote
GLOBECOM
2006
IEEE
16 years 21 days ago
2006
IEEE
— There has been a significant amount of work analyzing the Internet AS (Autonomous System)-level topology which gives rise to a number of topology models. Although each of thes...