1027 search results - page 116 / 206 » Ordered Vertex Partitioning |
IPL
2000
13 years 8 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
DAM
2008
13 years 8 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
ECCC
2010
13 years 7 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
BMVC
2010
13 years 7 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
CIARP
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...