scientific article; zbMATH DE number 1104328
From MaRDI portal
Publication:4370201
zbMath0897.05066MaRDI QIDQ4370201
Publication date: 19 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
Enumerating perfect matchings in \(n\)-cubes ⋮ On enumerating monomials and other combinatorial structures by polynomial interpolation ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Extension of some edge graph problems: standard, parameterized and approximation complexity ⋮ Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes ⋮ Finding all maximally-matchable edges in a bipartite graph ⋮ Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching ⋮ The parameterized complexity of some minimum label problems ⋮ An Efficient Algorithm for Enumerating Pseudo Cliques ⋮ Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ Size versus truthfulness in the house allocation problem ⋮ On the complexity of SNP block partitioning under the perfect phylogeny model ⋮ Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms ⋮ A fast algorithm to construct a representation for transversal matroids
This page was built for publication:
