Abstract. This article introduces an interactive system called Graph-Cuisine that lets users steer an Evolutionary Algorithm (EA) to create random graphs matching a set of user-specified measures. Generating random graphs with particular characteristics is crucial for evaluating graph algorithms, layouts and visualization techniques. Current random graph generators provide limited control of the final characteristics of the graphs they generate. The situation is even harder when one wants to generate random graphs similar to a given one. This is due to the fact that the similarity of graphs is often based on unknown parameters leading to a long and painful iterative process including steps of random graph generation, parameter changes, and ...
Students often struggle with the relationship between mathematical graphs and the data they represen...
x, 234 p. : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P COMP 2009 WongA number of differe...
We have generated sets of the problem instances obtained by using different pseudo-random methods to...
This paper introduces an interactive system called GraphCuisine that lets users steer an Evolutionar...
Random graph generation techniques provide an invaluable tool for studying graph related concepts. U...
High performance graph processing poses significant challenges for both algorithm and platform desig...
We propose a new evolutionary method of extracting user preferences from examples shown to an automa...
This book supports researchers who need to generate random networks, or who are interested in the th...
In the literature of Evolutionary Computation, it is very strange to find papers where the results o...
Abstract—We introduce an interactive graph generator, GreenSketch, designed to facilitate the creati...
Rule-based graph programming is a deep and rich topic. We present an approach to exploiting the powe...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
Graph Based Evolutionary Algorithms (GBEAs) are a novel modification to the local mating rules of an...
Optimization problems in the real world are very difficult to be solved by conventional optimization...
Dynamic graphs are an essential tool for representing a wide variety of concepts that change over ti...
Students often struggle with the relationship between mathematical graphs and the data they represen...
x, 234 p. : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P COMP 2009 WongA number of differe...
We have generated sets of the problem instances obtained by using different pseudo-random methods to...
This paper introduces an interactive system called GraphCuisine that lets users steer an Evolutionar...
Random graph generation techniques provide an invaluable tool for studying graph related concepts. U...
High performance graph processing poses significant challenges for both algorithm and platform desig...
We propose a new evolutionary method of extracting user preferences from examples shown to an automa...
This book supports researchers who need to generate random networks, or who are interested in the th...
In the literature of Evolutionary Computation, it is very strange to find papers where the results o...
Abstract—We introduce an interactive graph generator, GreenSketch, designed to facilitate the creati...
Rule-based graph programming is a deep and rich topic. We present an approach to exploiting the powe...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
Graph Based Evolutionary Algorithms (GBEAs) are a novel modification to the local mating rules of an...
Optimization problems in the real world are very difficult to be solved by conventional optimization...
Dynamic graphs are an essential tool for representing a wide variety of concepts that change over ti...
Students often struggle with the relationship between mathematical graphs and the data they represen...
x, 234 p. : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P COMP 2009 WongA number of differe...
We have generated sets of the problem instances obtained by using different pseudo-random methods to...