Sciweavers

3008 search results - page 60 / 602
» Independence in connected graphs
Sort
View
CORR
2004
Springer
83views Education» more  CORR 2004»
15 years 6 months ago
Generating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
Guy Melançon, Fabrice Philippe
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
16 years 9 days ago
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
Frank DiMaio, Jude W. Shavlik
WG
2009
Springer
15 years 10 months ago
Cycles, Paths, Connectivity and Diameter in Distance Graphs
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz ...