77 search results - page 10 / 16 » Large cycles in 4-connected graphs |
ICNC
2005
Springer
14 years 27 days ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
COMBINATORICA
2010
13 years 4 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
CASCON
1997
13 years 8 months ago
1997
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to confor...
AAAI
2012
11 years 9 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
APVIS
2007
13 years 8 months ago
2007
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...