3211 search results - page 129 / 643 » On the Grundy Number of a Graph |
151
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
158
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
156
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
177
click to vote
AAIM
2007
Springer
16 years 17 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
185
click to vote
WDAG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...