Sciweavers

8 search results - page 1 / 2
» Investigating the Existence and the Regularity of Logarithmi...
Sort
View
SRDS
2008
IEEE
14 years 5 months ago
Investigating the Existence and the Regularity of Logarithmic Harary Graphs
Roberto Baldoni, Silvia Bonomi, Leonardo Querzoni,...
DLT
2006
14 years 8 days ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
JGAA
2007
93views more  JGAA 2007»
13 years 10 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
13 years 10 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 11 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald