Sciweavers

57 search results - page 3 / 12
» Probabilistic graph and hypergraph matching
Sort
View
MST
2008
141views more  MST 2008»
13 years 5 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
COMBINATORICS
2006
156views more  COMBINATORICS 2006»
13 years 5 months ago
Total Domination and Matching Numbers in Claw-Free Graphs
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
Michael A. Henning, Anders Yeo
SSPR
2004
Springer
13 years 11 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
CIE
2006
Springer
13 years 9 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 16 days ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong