3204 search results - page 270 / 641 » The b-chromatic Number of a Graph |
EMMCVPR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper, we present an automatic human portrait system based on the And-Or graph representation. The system can automatically generate a set of life-like portraits ...
109
click to vote
TKDE
2008
15 years 20 days ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
137
click to vote
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
99
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...