3211 search results - page 191 / 643 » On the Grundy Number of a Graph |
161
click to vote
APPROX
2007
Springer
16 years 20 days ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
168
click to vote
3DPVT
2006
IEEE
16 years 17 days ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
164
click to vote
COCOON
2005
Springer
16 years 23 hour ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
152
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
171
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...