Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations

Broader (1)

Algebraic graph theory
Computing the permanentEdmonds matrixFKT algorithmGraph (discrete mathematics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2011
Review
2011
2 Detecting and Constructing Perfect Matchings : A First Pass 2 . 1 The Tutte matrix
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… 
2000
2000
Matrix Formulations of Matching Problems
Finding the maximum size of a matching in an undirected graph and nding the maximum size of branching in a directed graph can be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)