Sciweavers

2310 search results - page 66 / 462
» Coloring Random Graphs
Sort
View
222
Voted

Source Code
846views
15 years 9 months ago
Supervised Color Image Segmentation in a Markovian Framework
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chu...
Mihaly Gara, Zoltan Kato
114
Voted
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
15 years 17 days ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
118
Voted
JCO
2007
130views more  JCO 2007»
15 years 2 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
151
Voted
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
15 years 8 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
147
Voted
ICALP
2003
Springer
15 years 7 months ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang