760 search results - page 116 / 152 » Algorithms for finding clique-transversals of graphs |
131
click to vote
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
124
click to vote
3DPVT
2004
IEEE
15 years 5 months ago
2004
IEEE
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
107
Voted
AAAI
2007
15 years 4 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
116
click to vote
SIROCCO
2004
15 years 3 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
128
click to vote
IJCM
2002
15 years 1 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...