3204 search results - page 452 / 641 » The Alcuin Number of a Graph |
172
click to vote
COMBINATORICA
2007
15 years 7 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
181
click to vote
DAS
2010
Springer
15 years 11 months ago
2010
Springer
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
157
click to vote
DM
2010
15 years 7 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
181
click to vote
ENDM
2007
15 years 7 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
177
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...