1105 search results - page 71 / 221 » Linear choosability of graphs |
89
Voted
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
105
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
109
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
GD
2005
Springer
15 years 5 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
107
click to vote
ICPP
1999
IEEE
15 years 4 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...