Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

A new indirect way of producing all-quad meshes is presented. The method takes advantage of a wellknown algorithm of the graph… Expand

Is this relevant?

2012

2012

The well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs with k edge-disjoint spanning trees… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

This paper presents a matching method for 3D shapes, which comprises a new technique for surface sampling and two algorithms for… Expand

Is this relevant?

2006

2006

In this note, we give tighter bounds on the complexity of the bipartite unique perfect matching problem, bipartite-UPM. We show… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Generalizing a decision problem for bipartite perfect matching, J. Edmonds introduced in [14] the problem (now known as the… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

Introduction to graph theory algorithmic techniques shortest paths trees and acyclic diagraphs depth first search connectivity… Expand

Is this relevant?

1988

1988

This paper describes two algorithms for solving the following general problem: Given two polynomial maps f: R<supscrpt><italic>n… Expand

Is this relevant?

1965

1965

Edmonds d e veloped an efficient a lgorithm for finding in a given graph C a mat c hing of maximum cardinality. Thi s algorithm… Expand

Is this relevant?