Results 1  10
of
7,641
The Diameter of Almost Eulerian Digraphs
"... Soares [J. Graph Theory 1992] showed that the well known upper bound 3 δ+1n+ O(1) on the diameter of undirected graphs of order n and minimum degree δ also holds for digraphs, provided they are eulerian. In this paper we investigate if similar bounds can be given for digraphs that are, in some sense ..."
Abstract
 Add to MetaCart
Soares [J. Graph Theory 1992] showed that the well known upper bound 3 δ+1n+ O(1) on the diameter of undirected graphs of order n and minimum degree δ also holds for digraphs, provided they are eulerian. In this paper we investigate if similar bounds can be given for digraphs that are, in some
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently  those with shortrange forces where the neighbors of each atom change rapidly. They can be implemented on any distributedmemory parallel machine which allows for messagepassing of data between independently executing processors. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows that the current generation of parallel machines is competitive with conventi...
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such
Orientations of Digraphs Almost Preserving Diameter
 DISCRETE APPL. MATH
, 2000
"... An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x y of vertices such that both xy and yx are in D. In this paper, we consider certain wellknown classes of strong digraphs, each member D of which has an orie ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x y of vertices such that both xy and yx are in D. In this paper, we consider certain wellknown classes of strong digraphs, each member D of which has
Orientations of digraphs almost preserving diameter
"... Abstract An orientation of a digraph D is a spanning subdigraph of D obtained from Dby deleting exactly one arc between x and y for every pair x 6 = y of vertices suchthat both xy and yx are in D. In this paper, we consider certain wellknown classesof strong digraphs, each member D of which has an ..."
Abstract
 Add to MetaCart
Abstract An orientation of a digraph D is a spanning subdigraph of D obtained from Dby deleting exactly one arc between x and y for every pair x 6 = y of vertices suchthat both xy and yx are in D. In this paper, we consider certain wellknown classesof strong digraphs, each member D of which has
Orientations of digraphs almost preserving diameter
"... Abstract An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6 = y of vertices such that both xy and yx are in D. In this paper, we consider certain wellknown classes of strong digraphs, each member D of which has ..."
Abstract
 Add to MetaCart
Abstract An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6 = y of vertices such that both xy and yx are in D. In this paper, we consider certain wellknown classes of strong digraphs, each member D of which has
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 369 (11 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
Results 1  10
of
7,641