3192 search results - page 280 / 639 » The minimum latency problem |
149
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
Based on the linear expression of the dynamics of Boolean networks, the coordinate transformation of Boolean variables is defined. It follows that the state space coordinate trans...
158
Voted
ARSCOM
2007
15 years 6 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
162
click to vote
DAM
2008
15 years 6 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
157
click to vote
JCT
2006
15 years 6 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...