9532 search results - page 249 / 1907 » Logic, Graphs, and Algorithms |
158
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
140
click to vote
DAM
1998
15 years 5 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
183
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
145
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
176
click to vote
MICCAI
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...