684 search results - page 45 / 137 » A characterization of b-perfect graphs |
172
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
WG
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
158
click to vote
CVPR
2004
IEEE
15 years 5 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
114
click to vote
OPODIS
2008
15 years 3 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
156
click to vote
DAM
2011
14 years 5 months ago
2011
Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...