1749 search results - page 150 / 350 » Conditional colorings of graphs |
117
click to vote
EJC
2006
15 years 6 months ago
2006
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
174
click to vote
FGCS
2000
15 years 6 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
154
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
158
click to vote
ICMT
2010
Springer
15 years 11 months ago
2010
Springer
Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use,...
142
click to vote
CCCG
2009
15 years 7 months ago
2009
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...