945 search results - page 62 / 189 » Graph Types |
WG
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
137
click to vote
BMVC
2010
14 years 12 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. ...
126
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
145
click to vote
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
129
click to vote
CONSTRAINTS
2007
15 years 1 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...