Sciweavers

4865 search results - page 80 / 973
» The Complexity of Graph Connectivity
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
13 years 10 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 10 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
SMI
2003
IEEE
188views Image Analysis» more  SMI 2003»
14 years 3 months ago
On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
Craig Gotsman
GC
2007
Springer
13 years 10 months ago
Gray Code Enumeration of Plane Straight-Line Graphs
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
DAM
2002
76views more  DAM 2002»
13 years 10 months ago
Edge-pancyclicity of coupled graphs
The coupled graph c(G) of a plane graph G is the graph de
Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhan...