3757 search results - page 105 / 752 » The overlap number of a graph |
MICCAI
2010
Springer
14 years 8 months ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
115
click to vote
WG
2010
Springer
14 years 8 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...