Tutte matrix

In graph theory, the Tutte matrix A of a graph G = (V, E) is a matrix used to determine the existence of a perfect matching: that is, a set of edges… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2016
01219892016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
2. We further show that the weight of a maximum weighted matching can be efficiently estimated by augmenting any routine for… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2013
2013
We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of… (More)
Is this relevant?
Review
2013
Review
2013
Probably the first algebraic algorithm is the famous result of Lovasz, who proposed a Monte Carlo algorithm for finding the size… (More)
  • table 1
  • table 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2011
Review
2011
Given a set of nodes and edges between them, what’s the maximum of number of disjoint edges? This problem is known as the graph… (More)
Is this relevant?
2005
2005
Tutte associates a V by V skew-symmetric matrix T , having indeterminate entries, with a graph G=(V,E). This matrix, called the… (More)
  • figure 1
Is this relevant?
2004
2004
We present a simple estimator for the number of perfect matchings in a general (non-bipartite) graph. Our estimator requires <i>O… (More)
Is this relevant?
2000
2000
Tutte introduced a V by V skew-symmetric matrix T = (tij), called the Tutte matrix, associated with a simple graph G= (V,E). He… (More)
Is this relevant?
1995
1995
We focus on combinatorial problems arising from symmetric and skew{symmetric matrices. For much of the thesis we consider… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We present a new randomized algorithm for the maximum matching problem. Unlike conventional matching algorithms which are based… (More)
Is this relevant?