scientific article; zbMATH DE number 2081005
From MaRDI portal
Publication:4474103
zbMath1077.05515MaRDI QIDQ4474103
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230367.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Optimum matchings in weighted bipartite graphs ⋮ Enumerating perfect matchings in \(n\)-cubes ⋮ Compression with wildcards: all exact or all minimal hitting sets ⋮ Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes ⋮ Finding all maximally-matchable edges in a bipartite graph ⋮ Approximating the Interval Constrained Coloring Problem ⋮ Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching ⋮ Approximation algorithms for the interval constrained coloring problem ⋮ Unranking of small combinations from large sets ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ The stable marriage problem with master preference lists ⋮ Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms ⋮ The structural index of sensitivity equation systems ⋮ Counting Hamiltonian cycles in bipartite graphs ⋮ A fast algorithm to construct a representation for transversal matroids
This page was built for publication:
