Sciweavers

1321 search results - page 91 / 265
» Quadratic forms on graphs
Sort
View
133
Voted
COCOON
2005
Springer
15 years 2 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
110
Voted
LREC
2010
197views Education» more  LREC 2010»
15 years 2 months ago
Automatic Annotation of Co-Occurrence Relations
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
Dirk Goldhahn, Uwe Quasthoff
105
Voted
CCE
2006
15 years 23 days ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis
100
Voted
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
14 years 11 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
101
Voted
NETWORK
2010
122views more  NETWORK 2010»
14 years 7 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