scientific article; zbMATH DE number 2081005

MaRDI QIDQ4474103zbMATH OpenFDO

Authors Takeaki Uno

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230367.htm

zbMATH Keywords

enumerationenumerating algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1104328
• Finding all the perfect matchings in bipartite graphs
• A simple matching algorithm for regular bipartite graphs.
• Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs
• Finding all minimum-cost perfect matchings in Bipartite graphs

Cited in

(22)

• A fast algorithm to construct a representation for transversal matroids
• Optimum matchings in weighted bipartite graphs
• Finding all maximally-matchable edges in a bipartite graph
• Algorithms – ESA 2004
• Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
• scientific article; zbMATH DE number 4051678 (Why is no real title available?)
• The stable marriage problem with master preference lists
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
• An efficient algorithm for finding a two-pair, and its applications
• Approximating the Interval Constrained Coloring Problem
• Counting Hamiltonian cycles in bipartite graphs
• A polynomial algorithm for b-matchings: An alternative approach
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
• Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
• Unranking of small combinations from large sets
• Compression with wildcards: all exact or all minimal hitting sets
• On Fast Enumeration of Pseudo Bicliques
• The structural index of sensitivity equation systems
• Approximation algorithms for the interval constrained coloring problem
• Faster algorithm for finding maximum 1-restricted simple 2-matchings
• Enumerating perfect matchings in n-cubes
• Finding all minimum-cost perfect matchings in Bipartite graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474103)