Sciweavers

458 search results - page 11 / 92
» Totally magic graphs
Sort
View
TCBB
2011
13 years 3 months ago
Graph Comparison by Log-Odds Score Matrices with Application to Protein Topology Analysis
A TOPS diagram is a simplified description of the topology of a protein using a graph where nodes are α-helices and β-strands, and edges correspond to chirality relations and p...
J. Rocha
NETWORKS
2006
13 years 8 months ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek
NETWORK
2010
122views more  NETWORK 2010»
13 years 3 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
JSS
2010
89views more  JSS 2010»
13 years 3 months ago
Verification and validation of declarative model-to-model transformations through invariants
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
RSA
2000
112views more  RSA 2000»
13 years 8 months ago
Growth of components in random graphs
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Svante Janson