Sciweavers

1756 search results - page 80 / 352
» Directed scale-free graphs
Sort
View
HICSS
1995
IEEE
82views Biometrics» more  HICSS 1995»
13 years 11 months ago
A graph-theoretic data model for genome mapping databases
Graphs are a natural foundation for genome map databases. Mapping and other genomic data can be clearly represented by graphs, and graphs can be stored in a database. Graphs are d...
Mark Graves, Ellen R. Bergeman, Charles B. Lawrenc...
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
13 years 8 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
JGAA
2000
89views more  JGAA 2000»
13 years 7 months ago
Dynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
Ulrik Brandes, Vanessa Kääb, Andres L&ou...
GC
2010
Springer
13 years 6 months ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený
CPC
2011
219views Education» more  CPC 2011»
13 years 3 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson