6598 search results - page 25 / 1320 » Graph Theory with Applications |
154
Voted
TIT
2010
14 years 10 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
109
click to vote
COMBINATORICA
2008
15 years 3 months ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
124
Voted
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
123
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
135
Voted
WADT
1998
Springer
15 years 7 months ago
1998
Springer
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...