3008 search results - page 210 / 602 » Independence in connected graphs |
182
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
188
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation th...
153
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
145
click to vote
UAI
2004
15 years 8 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
157
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...