2503 search results - page 50 / 501 » A study of 3-arc graphs |
183
Voted
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Significant achievements have been made in the design and implementation of languages and tools for graph transformation systems. However, many other competing approaches...
191
click to vote
IPCO
2008
15 years 7 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
177
click to vote
IJAMCIGI
2010
15 years 21 days ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
152
click to vote
GD
2000
Springer
15 years 9 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
138
click to vote
PCM
2004
Springer
15 years 11 months ago
2004
Springer
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system und...