3211 search results - page 137 / 643 » On the Grundy Number of a Graph |
161
click to vote
WAW
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
158
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
232
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
189
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
180
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...