EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
94-XX Information and communication, circuits
94Cxx Circuits, networks
94C15 Applications of graph theory

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 4 of 4

Balancing cyclic $R$ -ary Gray codes.

Flahive, Mary, Bose, Bella (2007)

The Electronic Journal of Combinatorics [electronic only]

Balancing cyclic $R$ -ary Gray codes. II.

Flahive, Mary (2008)

The Electronic Journal of Combinatorics [electronic only]

Bounded expansion in web graphs

Silvia Gago, Dirk Schlatter (2009)

Commentationes Mathematicae Universitatis Carolinae

In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.

Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal

Alain Billionnet (1978)

RAIRO - Operations Research - Recherche Opérationnelle

Currently displaying 1 – 4 of 4